What are the divisors of 4414?

1, 2, 2207, 4414

2 even divisors

2, 4414

2 odd divisors

1, 2207

How to compute the divisors of 4414?

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

  • 4414 / 1 = 4414 (the remainder is 0, so 1 is a divisor of 4414)
  • 4414 / 2 = 2207 (the remainder is 0, so 2 is a divisor of 4414)
  • 4414 / 3 = 1471.3333333333 (the remainder is 1, so 3 is not a divisor of 4414)
  • ...
  • 4414 / 4413 = 1.0002266032178 (the remainder is 1, so 4413 is not a divisor of 4414)
  • 4414 / 4414 = 1 (the remainder is 0, so 4414 is a divisor of 4414)

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 4414 (i.e. 66.437940967492). 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 )

  • 4414 / 1 = 4414 (the remainder is 0, so 1 and 4414 are divisors of 4414)
  • 4414 / 2 = 2207 (the remainder is 0, so 2 and 2207 are divisors of 4414)
  • 4414 / 3 = 1471.3333333333 (the remainder is 1, so 3 is not a divisor of 4414)
  • ...
  • 4414 / 65 = 67.907692307692 (the remainder is 59, so 65 is not a divisor of 4414)
  • 4414 / 66 = 66.878787878788 (the remainder is 58, so 66 is not a divisor of 4414)