What are the divisors of 5594?

1, 2, 2797, 5594

There is a total of 4 positive divisors.
The sum of these divisors is 8394.
The arithmetic mean is 2098.5.

2 even divisors

2, 5594

2 odd divisors

1, 2797

How to compute the divisors of 5594?

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

5594 / 1 = 5594 (the remainder is 0, so 1 is a divisor of 5594)
5594 / 2 = 2797 (the remainder is 0, so 2 is a divisor of 5594)
5594 / 3 = 1864.6666666667 (the remainder is 2, so 3 is not a divisor of 5594)
...
5594 / 5593 = 1.0001787949222 (the remainder is 1, so 5593 is not a divisor of 5594)
5594 / 5594 = 1 (the remainder is 0, so 5594 is a divisor of 5594)

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 5594 (i.e. 74.793047805261). 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$ )

5594 / 1 = 5594 (the remainder is 0, so 1 and 5594 are divisors of 5594)
5594 / 2 = 2797 (the remainder is 0, so 2 and 2797 are divisors of 5594)
5594 / 3 = 1864.6666666667 (the remainder is 2, so 3 is not a divisor of 5594)
...
5594 / 73 = 76.630136986301 (the remainder is 46, so 73 is not a divisor of 5594)
5594 / 74 = 75.594594594595 (the remainder is 44, so 74 is not a divisor of 5594)