What are the divisors of 5224?

1, 2, 4, 8, 653, 1306, 2612, 5224

6 even divisors

2, 4, 8, 1306, 2612, 5224

2 odd divisors

1, 653

How to compute the divisors of 5224?

A number N is said to be divisible by a number M (with M non-zero) if, when we divide N by M, the remainder of the division is zero.

N mod M = 0

Brute force algorithm

We could start by using a brute-force method which would involve dividing 5224 by each of the numbers from 1 to 5224 to determine which ones have a remainder equal to 0.

Remainder = N ( M × N M )

(where N M is the integer part of the quotient)

  • 5224 / 1 = 5224 (the remainder is 0, so 1 is a divisor of 5224)
  • 5224 / 2 = 2612 (the remainder is 0, so 2 is a divisor of 5224)
  • 5224 / 3 = 1741.3333333333 (the remainder is 1, so 3 is not a divisor of 5224)
  • ...
  • 5224 / 5223 = 1.0001914608463 (the remainder is 1, so 5223 is not a divisor of 5224)
  • 5224 / 5224 = 1 (the remainder is 0, so 5224 is a divisor of 5224)

Improved algorithm using square-root

However, there is another slightly better approach that reduces the number of iterations by testing only integers less than or equal to the square root of 5224 (i.e. 72.277243998371). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:

D × d = N

(thus, if N D = d , then N d = D )

  • 5224 / 1 = 5224 (the remainder is 0, so 1 and 5224 are divisors of 5224)
  • 5224 / 2 = 2612 (the remainder is 0, so 2 and 2612 are divisors of 5224)
  • 5224 / 3 = 1741.3333333333 (the remainder is 1, so 3 is not a divisor of 5224)
  • ...
  • 5224 / 71 = 73.577464788732 (the remainder is 41, so 71 is not a divisor of 5224)
  • 5224 / 72 = 72.555555555556 (the remainder is 40, so 72 is not a divisor of 5224)