What are the divisors of 4665?

1, 3, 5, 15, 311, 933, 1555, 4665

There is a total of 8 positive divisors.
The sum of these divisors is 7488.
The arithmetic mean is 936.

8 odd divisors

1, 3, 5, 15, 311, 933, 1555, 4665

How to compute the divisors of 4665?

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

4665 / 1 = 4665 (the remainder is 0, so 1 is a divisor of 4665)
4665 / 2 = 2332.5 (the remainder is 1, so 2 is not a divisor of 4665)
4665 / 3 = 1555 (the remainder is 0, so 3 is a divisor of 4665)
...
4665 / 4664 = 1.0002144082333 (the remainder is 1, so 4664 is not a divisor of 4665)
4665 / 4665 = 1 (the remainder is 0, so 4665 is a divisor of 4665)

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 4665 (i.e. 68.300805266117). 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$ )

4665 / 1 = 4665 (the remainder is 0, so 1 and 4665 are divisors of 4665)
4665 / 2 = 2332.5 (the remainder is 1, so 2 is not a divisor of 4665)
4665 / 3 = 1555 (the remainder is 0, so 3 and 1555 are divisors of 4665)
...
4665 / 67 = 69.626865671642 (the remainder is 42, so 67 is not a divisor of 4665)
4665 / 68 = 68.602941176471 (the remainder is 41, so 68 is not a divisor of 4665)