What are the divisors of 2885?

1, 5, 577, 2885

4 odd divisors

1, 5, 577, 2885

How to compute the divisors of 2885?

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

  • 2885 / 1 = 2885 (the remainder is 0, so 1 is a divisor of 2885)
  • 2885 / 2 = 1442.5 (the remainder is 1, so 2 is not a divisor of 2885)
  • 2885 / 3 = 961.66666666667 (the remainder is 2, so 3 is not a divisor of 2885)
  • ...
  • 2885 / 2884 = 1.000346740638 (the remainder is 1, so 2884 is not a divisor of 2885)
  • 2885 / 2885 = 1 (the remainder is 0, so 2885 is a divisor of 2885)

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 2885 (i.e. 53.712196007983). 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 )

  • 2885 / 1 = 2885 (the remainder is 0, so 1 and 2885 are divisors of 2885)
  • 2885 / 2 = 1442.5 (the remainder is 1, so 2 is not a divisor of 2885)
  • 2885 / 3 = 961.66666666667 (the remainder is 2, so 3 is not a divisor of 2885)
  • ...
  • 2885 / 52 = 55.480769230769 (the remainder is 25, so 52 is not a divisor of 2885)
  • 2885 / 53 = 54.433962264151 (the remainder is 23, so 53 is not a divisor of 2885)