What are the divisors of 5370?

1, 2, 3, 5, 6, 10, 15, 30, 179, 358, 537, 895, 1074, 1790, 2685, 5370

There is a total of 16 positive divisors.
The sum of these divisors is 12960.
The arithmetic mean is 810.

8 even divisors

2, 6, 10, 30, 358, 1074, 1790, 5370

8 odd divisors

1, 3, 5, 15, 179, 537, 895, 2685

How to compute the divisors of 5370?

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

5370 / 1 = 5370 (the remainder is 0, so 1 is a divisor of 5370)
5370 / 2 = 2685 (the remainder is 0, so 2 is a divisor of 5370)
5370 / 3 = 1790 (the remainder is 0, so 3 is a divisor of 5370)
...
5370 / 5369 = 1.0001862544235 (the remainder is 1, so 5369 is not a divisor of 5370)
5370 / 5370 = 1 (the remainder is 0, so 5370 is a divisor of 5370)

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 5370 (i.e. 73.280283842245). 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$ )

5370 / 1 = 5370 (the remainder is 0, so 1 and 5370 are divisors of 5370)
5370 / 2 = 2685 (the remainder is 0, so 2 and 2685 are divisors of 5370)
5370 / 3 = 1790 (the remainder is 0, so 3 and 1790 are divisors of 5370)
...
5370 / 72 = 74.583333333333 (the remainder is 42, so 72 is not a divisor of 5370)
5370 / 73 = 73.561643835616 (the remainder is 41, so 73 is not a divisor of 5370)