What are the divisors of 4445?

1, 5, 7, 35, 127, 635, 889, 4445

8 odd divisors

1, 5, 7, 35, 127, 635, 889, 4445

How to compute the divisors of 4445?

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

  • 4445 / 1 = 4445 (the remainder is 0, so 1 is a divisor of 4445)
  • 4445 / 2 = 2222.5 (the remainder is 1, so 2 is not a divisor of 4445)
  • 4445 / 3 = 1481.6666666667 (the remainder is 2, so 3 is not a divisor of 4445)
  • ...
  • 4445 / 4444 = 1.0002250225023 (the remainder is 1, so 4444 is not a divisor of 4445)
  • 4445 / 4445 = 1 (the remainder is 0, so 4445 is a divisor of 4445)

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 4445 (i.e. 66.670833203133). 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 )

  • 4445 / 1 = 4445 (the remainder is 0, so 1 and 4445 are divisors of 4445)
  • 4445 / 2 = 2222.5 (the remainder is 1, so 2 is not a divisor of 4445)
  • 4445 / 3 = 1481.6666666667 (the remainder is 2, so 3 is not a divisor of 4445)
  • ...
  • 4445 / 65 = 68.384615384615 (the remainder is 25, so 65 is not a divisor of 4445)
  • 4445 / 66 = 67.348484848485 (the remainder is 23, so 66 is not a divisor of 4445)