What are the divisors of 4461?

1, 3, 1487, 4461

There is a total of 4 positive divisors.
The sum of these divisors is 5952.
The arithmetic mean is 1488.

4 odd divisors

1, 3, 1487, 4461

How to compute the divisors of 4461?

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

4461 / 1 = 4461 (the remainder is 0, so 1 is a divisor of 4461)
4461 / 2 = 2230.5 (the remainder is 1, so 2 is not a divisor of 4461)
4461 / 3 = 1487 (the remainder is 0, so 3 is a divisor of 4461)
...
4461 / 4460 = 1.0002242152466 (the remainder is 1, so 4460 is not a divisor of 4461)
4461 / 4461 = 1 (the remainder is 0, so 4461 is a divisor of 4461)

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 4461 (i.e. 66.790717917986). 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$ )

4461 / 1 = 4461 (the remainder is 0, so 1 and 4461 are divisors of 4461)
4461 / 2 = 2230.5 (the remainder is 1, so 2 is not a divisor of 4461)
4461 / 3 = 1487 (the remainder is 0, so 3 and 1487 are divisors of 4461)
...
4461 / 65 = 68.630769230769 (the remainder is 41, so 65 is not a divisor of 4461)
4461 / 66 = 67.590909090909 (the remainder is 39, so 66 is not a divisor of 4461)