What are the divisors of 2497?

1, 11, 227, 2497

4 odd divisors

1, 11, 227, 2497

How to compute the divisors of 2497?

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

  • 2497 / 1 = 2497 (the remainder is 0, so 1 is a divisor of 2497)
  • 2497 / 2 = 1248.5 (the remainder is 1, so 2 is not a divisor of 2497)
  • 2497 / 3 = 832.33333333333 (the remainder is 1, so 3 is not a divisor of 2497)
  • ...
  • 2497 / 2496 = 1.0004006410256 (the remainder is 1, so 2496 is not a divisor of 2497)
  • 2497 / 2497 = 1 (the remainder is 0, so 2497 is a divisor of 2497)

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 2497 (i.e. 49.969990994596). 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 )

  • 2497 / 1 = 2497 (the remainder is 0, so 1 and 2497 are divisors of 2497)
  • 2497 / 2 = 1248.5 (the remainder is 1, so 2 is not a divisor of 2497)
  • 2497 / 3 = 832.33333333333 (the remainder is 1, so 3 is not a divisor of 2497)
  • ...
  • 2497 / 48 = 52.020833333333 (the remainder is 1, so 48 is not a divisor of 2497)
  • 2497 / 49 = 50.959183673469 (the remainder is 47, so 49 is not a divisor of 2497)