What are the divisors of 5014?

1, 2, 23, 46, 109, 218, 2507, 5014

4 even divisors

2, 46, 218, 5014

4 odd divisors

1, 23, 109, 2507

How to compute the divisors of 5014?

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

  • 5014 / 1 = 5014 (the remainder is 0, so 1 is a divisor of 5014)
  • 5014 / 2 = 2507 (the remainder is 0, so 2 is a divisor of 5014)
  • 5014 / 3 = 1671.3333333333 (the remainder is 1, so 3 is not a divisor of 5014)
  • ...
  • 5014 / 5013 = 1.0001994813485 (the remainder is 1, so 5013 is not a divisor of 5014)
  • 5014 / 5014 = 1 (the remainder is 0, so 5014 is a divisor of 5014)

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 5014 (i.e. 70.809603868402). 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 )

  • 5014 / 1 = 5014 (the remainder is 0, so 1 and 5014 are divisors of 5014)
  • 5014 / 2 = 2507 (the remainder is 0, so 2 and 2507 are divisors of 5014)
  • 5014 / 3 = 1671.3333333333 (the remainder is 1, so 3 is not a divisor of 5014)
  • ...
  • 5014 / 69 = 72.666666666667 (the remainder is 46, so 69 is not a divisor of 5014)
  • 5014 / 70 = 71.628571428571 (the remainder is 44, so 70 is not a divisor of 5014)