What are the divisors of 5129?

1, 23, 223, 5129

4 odd divisors

1, 23, 223, 5129

How to compute the divisors of 5129?

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

  • 5129 / 1 = 5129 (the remainder is 0, so 1 is a divisor of 5129)
  • 5129 / 2 = 2564.5 (the remainder is 1, so 2 is not a divisor of 5129)
  • 5129 / 3 = 1709.6666666667 (the remainder is 2, so 3 is not a divisor of 5129)
  • ...
  • 5129 / 5128 = 1.0001950078003 (the remainder is 1, so 5128 is not a divisor of 5129)
  • 5129 / 5129 = 1 (the remainder is 0, so 5129 is a divisor of 5129)

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 5129 (i.e. 71.617037079176). 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 )

  • 5129 / 1 = 5129 (the remainder is 0, so 1 and 5129 are divisors of 5129)
  • 5129 / 2 = 2564.5 (the remainder is 1, so 2 is not a divisor of 5129)
  • 5129 / 3 = 1709.6666666667 (the remainder is 2, so 3 is not a divisor of 5129)
  • ...
  • 5129 / 70 = 73.271428571429 (the remainder is 19, so 70 is not a divisor of 5129)
  • 5129 / 71 = 72.239436619718 (the remainder is 17, so 71 is not a divisor of 5129)