What are the divisors of 2787?

1, 3, 929, 2787

4 odd divisors

1, 3, 929, 2787

How to compute the divisors of 2787?

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

  • 2787 / 1 = 2787 (the remainder is 0, so 1 is a divisor of 2787)
  • 2787 / 2 = 1393.5 (the remainder is 1, so 2 is not a divisor of 2787)
  • 2787 / 3 = 929 (the remainder is 0, so 3 is a divisor of 2787)
  • ...
  • 2787 / 2786 = 1.0003589375449 (the remainder is 1, so 2786 is not a divisor of 2787)
  • 2787 / 2787 = 1 (the remainder is 0, so 2787 is a divisor of 2787)

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 2787 (i.e. 52.792044855262). 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 )

  • 2787 / 1 = 2787 (the remainder is 0, so 1 and 2787 are divisors of 2787)
  • 2787 / 2 = 1393.5 (the remainder is 1, so 2 is not a divisor of 2787)
  • 2787 / 3 = 929 (the remainder is 0, so 3 and 929 are divisors of 2787)
  • ...
  • 2787 / 51 = 54.647058823529 (the remainder is 33, so 51 is not a divisor of 2787)
  • 2787 / 52 = 53.596153846154 (the remainder is 31, so 52 is not a divisor of 2787)