What are the divisors of 5662?

1, 2, 19, 38, 149, 298, 2831, 5662

4 even divisors

2, 38, 298, 5662

4 odd divisors

1, 19, 149, 2831

How to compute the divisors of 5662?

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

  • 5662 / 1 = 5662 (the remainder is 0, so 1 is a divisor of 5662)
  • 5662 / 2 = 2831 (the remainder is 0, so 2 is a divisor of 5662)
  • 5662 / 3 = 1887.3333333333 (the remainder is 1, so 3 is not a divisor of 5662)
  • ...
  • 5662 / 5661 = 1.0001766472355 (the remainder is 1, so 5661 is not a divisor of 5662)
  • 5662 / 5662 = 1 (the remainder is 0, so 5662 is a divisor of 5662)

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 5662 (i.e. 75.246262365648). 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 )

  • 5662 / 1 = 5662 (the remainder is 0, so 1 and 5662 are divisors of 5662)
  • 5662 / 2 = 2831 (the remainder is 0, so 2 and 2831 are divisors of 5662)
  • 5662 / 3 = 1887.3333333333 (the remainder is 1, so 3 is not a divisor of 5662)
  • ...
  • 5662 / 74 = 76.513513513514 (the remainder is 38, so 74 is not a divisor of 5662)
  • 5662 / 75 = 75.493333333333 (the remainder is 37, so 75 is not a divisor of 5662)