What are the divisors of 2778?

1, 2, 3, 6, 463, 926, 1389, 2778

4 even divisors

2, 6, 926, 2778

4 odd divisors

1, 3, 463, 1389

How to compute the divisors of 2778?

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

  • 2778 / 1 = 2778 (the remainder is 0, so 1 is a divisor of 2778)
  • 2778 / 2 = 1389 (the remainder is 0, so 2 is a divisor of 2778)
  • 2778 / 3 = 926 (the remainder is 0, so 3 is a divisor of 2778)
  • ...
  • 2778 / 2777 = 1.0003601008282 (the remainder is 1, so 2777 is not a divisor of 2778)
  • 2778 / 2778 = 1 (the remainder is 0, so 2778 is a divisor of 2778)

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 2778 (i.e. 52.706735812418). 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 )

  • 2778 / 1 = 2778 (the remainder is 0, so 1 and 2778 are divisors of 2778)
  • 2778 / 2 = 1389 (the remainder is 0, so 2 and 1389 are divisors of 2778)
  • 2778 / 3 = 926 (the remainder is 0, so 3 and 926 are divisors of 2778)
  • ...
  • 2778 / 51 = 54.470588235294 (the remainder is 24, so 51 is not a divisor of 2778)
  • 2778 / 52 = 53.423076923077 (the remainder is 22, so 52 is not a divisor of 2778)