What are the divisors of 2158?

1, 2, 13, 26, 83, 166, 1079, 2158

4 even divisors

2, 26, 166, 2158

4 odd divisors

1, 13, 83, 1079

How to compute the divisors of 2158?

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

  • 2158 / 1 = 2158 (the remainder is 0, so 1 is a divisor of 2158)
  • 2158 / 2 = 1079 (the remainder is 0, so 2 is a divisor of 2158)
  • 2158 / 3 = 719.33333333333 (the remainder is 1, so 3 is not a divisor of 2158)
  • ...
  • 2158 / 2157 = 1.0004636068614 (the remainder is 1, so 2157 is not a divisor of 2158)
  • 2158 / 2158 = 1 (the remainder is 0, so 2158 is a divisor of 2158)

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 2158 (i.e. 46.454278597348). 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 )

  • 2158 / 1 = 2158 (the remainder is 0, so 1 and 2158 are divisors of 2158)
  • 2158 / 2 = 1079 (the remainder is 0, so 2 and 1079 are divisors of 2158)
  • 2158 / 3 = 719.33333333333 (the remainder is 1, so 3 is not a divisor of 2158)
  • ...
  • 2158 / 45 = 47.955555555556 (the remainder is 43, so 45 is not a divisor of 2158)
  • 2158 / 46 = 46.913043478261 (the remainder is 42, so 46 is not a divisor of 2158)