What are the divisors of 2621?

1, 2621

2 odd divisors

1, 2621

How to compute the divisors of 2621?

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

  • 2621 / 1 = 2621 (the remainder is 0, so 1 is a divisor of 2621)
  • 2621 / 2 = 1310.5 (the remainder is 1, so 2 is not a divisor of 2621)
  • 2621 / 3 = 873.66666666667 (the remainder is 2, so 3 is not a divisor of 2621)
  • ...
  • 2621 / 2620 = 1.0003816793893 (the remainder is 1, so 2620 is not a divisor of 2621)
  • 2621 / 2621 = 1 (the remainder is 0, so 2621 is a divisor of 2621)

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 2621 (i.e. 51.195702944681). 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 )

  • 2621 / 1 = 2621 (the remainder is 0, so 1 and 2621 are divisors of 2621)
  • 2621 / 2 = 1310.5 (the remainder is 1, so 2 is not a divisor of 2621)
  • 2621 / 3 = 873.66666666667 (the remainder is 2, so 3 is not a divisor of 2621)
  • ...
  • 2621 / 50 = 52.42 (the remainder is 21, so 50 is not a divisor of 2621)
  • 2621 / 51 = 51.392156862745 (the remainder is 20, so 51 is not a divisor of 2621)