What are the divisors of 5599?

1, 11, 509, 5599

There is a total of 4 positive divisors.
The sum of these divisors is 6120.
The arithmetic mean is 1530.

4 odd divisors

1, 11, 509, 5599

How to compute the divisors of 5599?

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 5599 by each of the numbers from 1 to 5599 to determine which ones have a remainder equal to 0.

$Remainder = N - (M \times ⌊ \frac{N}{M} ⌋)$

(where $⌊ \frac{N}{M} ⌋$ is the integer part of the quotient)

5599 / 1 = 5599 (the remainder is 0, so 1 is a divisor of 5599)
5599 / 2 = 2799.5 (the remainder is 1, so 2 is not a divisor of 5599)
5599 / 3 = 1866.3333333333 (the remainder is 1, so 3 is not a divisor of 5599)
...
5599 / 5598 = 1.0001786352269 (the remainder is 1, so 5598 is not a divisor of 5599)
5599 / 5599 = 1 (the remainder is 0, so 5599 is a divisor of 5599)

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 5599 (i.e. 74.826465906122). 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 \times d = N$

(thus, if $\frac{N}{D} = d$ , then $\frac{N}{d} = D$ )

5599 / 1 = 5599 (the remainder is 0, so 1 and 5599 are divisors of 5599)
5599 / 2 = 2799.5 (the remainder is 1, so 2 is not a divisor of 5599)
5599 / 3 = 1866.3333333333 (the remainder is 1, so 3 is not a divisor of 5599)
...
5599 / 73 = 76.698630136986 (the remainder is 51, so 73 is not a divisor of 5599)
5599 / 74 = 75.662162162162 (the remainder is 49, so 74 is not a divisor of 5599)