What are the divisors of 2111?

1, 2111

2 odd divisors

1, 2111

How to compute the divisors of 2111?

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

  • 2111 / 1 = 2111 (the remainder is 0, so 1 is a divisor of 2111)
  • 2111 / 2 = 1055.5 (the remainder is 1, so 2 is not a divisor of 2111)
  • 2111 / 3 = 703.66666666667 (the remainder is 2, so 3 is not a divisor of 2111)
  • ...
  • 2111 / 2110 = 1.0004739336493 (the remainder is 1, so 2110 is not a divisor of 2111)
  • 2111 / 2111 = 1 (the remainder is 0, so 2111 is a divisor of 2111)

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 2111 (i.e. 45.945620030641). 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 )

  • 2111 / 1 = 2111 (the remainder is 0, so 1 and 2111 are divisors of 2111)
  • 2111 / 2 = 1055.5 (the remainder is 1, so 2 is not a divisor of 2111)
  • 2111 / 3 = 703.66666666667 (the remainder is 2, so 3 is not a divisor of 2111)
  • ...
  • 2111 / 44 = 47.977272727273 (the remainder is 43, so 44 is not a divisor of 2111)
  • 2111 / 45 = 46.911111111111 (the remainder is 41, so 45 is not a divisor of 2111)