What are the divisors of 6026?

1, 2, 23, 46, 131, 262, 3013, 6026

4 even divisors

2, 46, 262, 6026

4 odd divisors

1, 23, 131, 3013

How to compute the divisors of 6026?

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

  • 6026 / 1 = 6026 (the remainder is 0, so 1 is a divisor of 6026)
  • 6026 / 2 = 3013 (the remainder is 0, so 2 is a divisor of 6026)
  • 6026 / 3 = 2008.6666666667 (the remainder is 2, so 3 is not a divisor of 6026)
  • ...
  • 6026 / 6025 = 1.0001659751037 (the remainder is 1, so 6025 is not a divisor of 6026)
  • 6026 / 6026 = 1 (the remainder is 0, so 6026 is a divisor of 6026)

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 6026 (i.e. 77.627314780301). 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 )

  • 6026 / 1 = 6026 (the remainder is 0, so 1 and 6026 are divisors of 6026)
  • 6026 / 2 = 3013 (the remainder is 0, so 2 and 3013 are divisors of 6026)
  • 6026 / 3 = 2008.6666666667 (the remainder is 2, so 3 is not a divisor of 6026)
  • ...
  • 6026 / 76 = 79.289473684211 (the remainder is 22, so 76 is not a divisor of 6026)
  • 6026 / 77 = 78.25974025974 (the remainder is 20, so 77 is not a divisor of 6026)