What are the divisors of 2631?

1, 3, 877, 2631

4 odd divisors

1, 3, 877, 2631

How to compute the divisors of 2631?

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

  • 2631 / 1 = 2631 (the remainder is 0, so 1 is a divisor of 2631)
  • 2631 / 2 = 1315.5 (the remainder is 1, so 2 is not a divisor of 2631)
  • 2631 / 3 = 877 (the remainder is 0, so 3 is a divisor of 2631)
  • ...
  • 2631 / 2630 = 1.0003802281369 (the remainder is 1, so 2630 is not a divisor of 2631)
  • 2631 / 2631 = 1 (the remainder is 0, so 2631 is a divisor of 2631)

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 2631 (i.e. 51.293274412929). 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 )

  • 2631 / 1 = 2631 (the remainder is 0, so 1 and 2631 are divisors of 2631)
  • 2631 / 2 = 1315.5 (the remainder is 1, so 2 is not a divisor of 2631)
  • 2631 / 3 = 877 (the remainder is 0, so 3 and 877 are divisors of 2631)
  • ...
  • 2631 / 50 = 52.62 (the remainder is 31, so 50 is not a divisor of 2631)
  • 2631 / 51 = 51.588235294118 (the remainder is 30, so 51 is not a divisor of 2631)