What are the divisors of 5396?

1, 2, 4, 19, 38, 71, 76, 142, 284, 1349, 2698, 5396

There is a total of 12 positive divisors.
The sum of these divisors is 10080.
The arithmetic mean is 840.

8 even divisors

2, 4, 38, 76, 142, 284, 2698, 5396

4 odd divisors

1, 19, 71, 1349

How to compute the divisors of 5396?

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

5396 / 1 = 5396 (the remainder is 0, so 1 is a divisor of 5396)
5396 / 2 = 2698 (the remainder is 0, so 2 is a divisor of 5396)
5396 / 3 = 1798.6666666667 (the remainder is 2, so 3 is not a divisor of 5396)
...
5396 / 5395 = 1.0001853568119 (the remainder is 1, so 5395 is not a divisor of 5396)
5396 / 5396 = 1 (the remainder is 0, so 5396 is a divisor of 5396)

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 5396 (i.e. 73.457470688828). 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$ )

5396 / 1 = 5396 (the remainder is 0, so 1 and 5396 are divisors of 5396)
5396 / 2 = 2698 (the remainder is 0, so 2 and 2698 are divisors of 5396)
5396 / 3 = 1798.6666666667 (the remainder is 2, so 3 is not a divisor of 5396)
...
5396 / 72 = 74.944444444444 (the remainder is 68, so 72 is not a divisor of 5396)
5396 / 73 = 73.917808219178 (the remainder is 67, so 73 is not a divisor of 5396)