What are the divisors of 5185?

1, 5, 17, 61, 85, 305, 1037, 5185

8 odd divisors

1, 5, 17, 61, 85, 305, 1037, 5185

How to compute the divisors of 5185?

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

  • 5185 / 1 = 5185 (the remainder is 0, so 1 is a divisor of 5185)
  • 5185 / 2 = 2592.5 (the remainder is 1, so 2 is not a divisor of 5185)
  • 5185 / 3 = 1728.3333333333 (the remainder is 1, so 3 is not a divisor of 5185)
  • ...
  • 5185 / 5184 = 1.0001929012346 (the remainder is 1, so 5184 is not a divisor of 5185)
  • 5185 / 5185 = 1 (the remainder is 0, so 5185 is a divisor of 5185)

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 5185 (i.e. 72.006944109579). 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 )

  • 5185 / 1 = 5185 (the remainder is 0, so 1 and 5185 are divisors of 5185)
  • 5185 / 2 = 2592.5 (the remainder is 1, so 2 is not a divisor of 5185)
  • 5185 / 3 = 1728.3333333333 (the remainder is 1, so 3 is not a divisor of 5185)
  • ...
  • 5185 / 71 = 73.028169014085 (the remainder is 2, so 71 is not a divisor of 5185)
  • 5185 / 72 = 72.013888888889 (the remainder is 1, so 72 is not a divisor of 5185)