What are the divisors of 5862?

1, 2, 3, 6, 977, 1954, 2931, 5862

4 even divisors

2, 6, 1954, 5862

4 odd divisors

1, 3, 977, 2931

How to compute the divisors of 5862?

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

  • 5862 / 1 = 5862 (the remainder is 0, so 1 is a divisor of 5862)
  • 5862 / 2 = 2931 (the remainder is 0, so 2 is a divisor of 5862)
  • 5862 / 3 = 1954 (the remainder is 0, so 3 is a divisor of 5862)
  • ...
  • 5862 / 5861 = 1.0001706193482 (the remainder is 1, so 5861 is not a divisor of 5862)
  • 5862 / 5862 = 1 (the remainder is 0, so 5862 is a divisor of 5862)

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 5862 (i.e. 76.563698970204). 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 )

  • 5862 / 1 = 5862 (the remainder is 0, so 1 and 5862 are divisors of 5862)
  • 5862 / 2 = 2931 (the remainder is 0, so 2 and 2931 are divisors of 5862)
  • 5862 / 3 = 1954 (the remainder is 0, so 3 and 1954 are divisors of 5862)
  • ...
  • 5862 / 75 = 78.16 (the remainder is 12, so 75 is not a divisor of 5862)
  • 5862 / 76 = 77.131578947368 (the remainder is 10, so 76 is not a divisor of 5862)