What are the divisors of 2686?

1, 2, 17, 34, 79, 158, 1343, 2686

4 even divisors

2, 34, 158, 2686

4 odd divisors

1, 17, 79, 1343

How to compute the divisors of 2686?

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

  • 2686 / 1 = 2686 (the remainder is 0, so 1 is a divisor of 2686)
  • 2686 / 2 = 1343 (the remainder is 0, so 2 is a divisor of 2686)
  • 2686 / 3 = 895.33333333333 (the remainder is 1, so 3 is not a divisor of 2686)
  • ...
  • 2686 / 2685 = 1.0003724394786 (the remainder is 1, so 2685 is not a divisor of 2686)
  • 2686 / 2686 = 1 (the remainder is 0, so 2686 is a divisor of 2686)

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 2686 (i.e. 51.8266340794). 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 )

  • 2686 / 1 = 2686 (the remainder is 0, so 1 and 2686 are divisors of 2686)
  • 2686 / 2 = 1343 (the remainder is 0, so 2 and 1343 are divisors of 2686)
  • 2686 / 3 = 895.33333333333 (the remainder is 1, so 3 is not a divisor of 2686)
  • ...
  • 2686 / 50 = 53.72 (the remainder is 36, so 50 is not a divisor of 2686)
  • 2686 / 51 = 52.666666666667 (the remainder is 34, so 51 is not a divisor of 2686)