What are the divisors of 4449?

1, 3, 1483, 4449

4 odd divisors

1, 3, 1483, 4449

How to compute the divisors of 4449?

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 4449 by each of the numbers from 1 to 4449 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)

  • 4449 / 1 = 4449 (the remainder is 0, so 1 is a divisor of 4449)
  • 4449 / 2 = 2224.5 (the remainder is 1, so 2 is not a divisor of 4449)
  • 4449 / 3 = 1483 (the remainder is 0, so 3 is a divisor of 4449)
  • ...
  • 4449 / 4448 = 1.0002248201439 (the remainder is 1, so 4448 is not a divisor of 4449)
  • 4449 / 4449 = 1 (the remainder is 0, so 4449 is a divisor of 4449)

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 4449 (i.e. 66.700824582609). 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 )

  • 4449 / 1 = 4449 (the remainder is 0, so 1 and 4449 are divisors of 4449)
  • 4449 / 2 = 2224.5 (the remainder is 1, so 2 is not a divisor of 4449)
  • 4449 / 3 = 1483 (the remainder is 0, so 3 and 1483 are divisors of 4449)
  • ...
  • 4449 / 65 = 68.446153846154 (the remainder is 29, so 65 is not a divisor of 4449)
  • 4449 / 66 = 67.409090909091 (the remainder is 27, so 66 is not a divisor of 4449)