What are the divisors of 4671?

1, 3, 9, 27, 173, 519, 1557, 4671

There is a total of 8 positive divisors.
The sum of these divisors is 6960.
The arithmetic mean is 870.

8 odd divisors

1, 3, 9, 27, 173, 519, 1557, 4671

How to compute the divisors of 4671?

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

4671 / 1 = 4671 (the remainder is 0, so 1 is a divisor of 4671)
4671 / 2 = 2335.5 (the remainder is 1, so 2 is not a divisor of 4671)
4671 / 3 = 1557 (the remainder is 0, so 3 is a divisor of 4671)
...
4671 / 4670 = 1.0002141327623 (the remainder is 1, so 4670 is not a divisor of 4671)
4671 / 4671 = 1 (the remainder is 0, so 4671 is a divisor of 4671)

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 4671 (i.e. 68.344714499367). 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$ )

4671 / 1 = 4671 (the remainder is 0, so 1 and 4671 are divisors of 4671)
4671 / 2 = 2335.5 (the remainder is 1, so 2 is not a divisor of 4671)
4671 / 3 = 1557 (the remainder is 0, so 3 and 1557 are divisors of 4671)
...
4671 / 67 = 69.716417910448 (the remainder is 48, so 67 is not a divisor of 4671)
4671 / 68 = 68.691176470588 (the remainder is 47, so 68 is not a divisor of 4671)