What are the divisors of 4371?

1, 3, 31, 47, 93, 141, 1457, 4371

There is a total of 8 positive divisors.
The sum of these divisors is 6144.
The arithmetic mean is 768.

8 odd divisors

1, 3, 31, 47, 93, 141, 1457, 4371

How to compute the divisors of 4371?

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

4371 / 1 = 4371 (the remainder is 0, so 1 is a divisor of 4371)
4371 / 2 = 2185.5 (the remainder is 1, so 2 is not a divisor of 4371)
4371 / 3 = 1457 (the remainder is 0, so 3 is a divisor of 4371)
...
4371 / 4370 = 1.0002288329519 (the remainder is 1, so 4370 is not a divisor of 4371)
4371 / 4371 = 1 (the remainder is 0, so 4371 is a divisor of 4371)

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 4371 (i.e. 66.113538704262). 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$ )

4371 / 1 = 4371 (the remainder is 0, so 1 and 4371 are divisors of 4371)
4371 / 2 = 2185.5 (the remainder is 1, so 2 is not a divisor of 4371)
4371 / 3 = 1457 (the remainder is 0, so 3 and 1457 are divisors of 4371)
...
4371 / 65 = 67.246153846154 (the remainder is 16, so 65 is not a divisor of 4371)
4371 / 66 = 66.227272727273 (the remainder is 15, so 66 is not a divisor of 4371)