What are the divisors of 5387?

1, 5387

2 odd divisors

1, 5387

How to compute the divisors of 5387?

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

  • 5387 / 1 = 5387 (the remainder is 0, so 1 is a divisor of 5387)
  • 5387 / 2 = 2693.5 (the remainder is 1, so 2 is not a divisor of 5387)
  • 5387 / 3 = 1795.6666666667 (the remainder is 2, so 3 is not a divisor of 5387)
  • ...
  • 5387 / 5386 = 1.0001856665429 (the remainder is 1, so 5386 is not a divisor of 5387)
  • 5387 / 5387 = 1 (the remainder is 0, so 5387 is a divisor of 5387)

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 5387 (i.e. 73.39618518697). 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 )

  • 5387 / 1 = 5387 (the remainder is 0, so 1 and 5387 are divisors of 5387)
  • 5387 / 2 = 2693.5 (the remainder is 1, so 2 is not a divisor of 5387)
  • 5387 / 3 = 1795.6666666667 (the remainder is 2, so 3 is not a divisor of 5387)
  • ...
  • 5387 / 72 = 74.819444444444 (the remainder is 59, so 72 is not a divisor of 5387)
  • 5387 / 73 = 73.794520547945 (the remainder is 58, so 73 is not a divisor of 5387)