What are the divisors of 5519?

1, 5519

2 odd divisors

1, 5519

How to compute the divisors of 5519?

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

  • 5519 / 1 = 5519 (the remainder is 0, so 1 is a divisor of 5519)
  • 5519 / 2 = 2759.5 (the remainder is 1, so 2 is not a divisor of 5519)
  • 5519 / 3 = 1839.6666666667 (the remainder is 2, so 3 is not a divisor of 5519)
  • ...
  • 5519 / 5518 = 1.0001812250816 (the remainder is 1, so 5518 is not a divisor of 5519)
  • 5519 / 5519 = 1 (the remainder is 0, so 5519 is a divisor of 5519)

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 5519 (i.e. 74.289972405433). 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 )

  • 5519 / 1 = 5519 (the remainder is 0, so 1 and 5519 are divisors of 5519)
  • 5519 / 2 = 2759.5 (the remainder is 1, so 2 is not a divisor of 5519)
  • 5519 / 3 = 1839.6666666667 (the remainder is 2, so 3 is not a divisor of 5519)
  • ...
  • 5519 / 73 = 75.602739726027 (the remainder is 44, so 73 is not a divisor of 5519)
  • 5519 / 74 = 74.581081081081 (the remainder is 43, so 74 is not a divisor of 5519)