What are the divisors of 4055?

1, 5, 811, 4055

There is a total of 4 positive divisors.
The sum of these divisors is 4872.
The arithmetic mean is 1218.

4 odd divisors

1, 5, 811, 4055

How to compute the divisors of 4055?

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

4055 / 1 = 4055 (the remainder is 0, so 1 is a divisor of 4055)
4055 / 2 = 2027.5 (the remainder is 1, so 2 is not a divisor of 4055)
4055 / 3 = 1351.6666666667 (the remainder is 2, so 3 is not a divisor of 4055)
...
4055 / 4054 = 1.0002466699556 (the remainder is 1, so 4054 is not a divisor of 4055)
4055 / 4055 = 1 (the remainder is 0, so 4055 is a divisor of 4055)

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 4055 (i.e. 63.678881899732). 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$ )

4055 / 1 = 4055 (the remainder is 0, so 1 and 4055 are divisors of 4055)
4055 / 2 = 2027.5 (the remainder is 1, so 2 is not a divisor of 4055)
4055 / 3 = 1351.6666666667 (the remainder is 2, so 3 is not a divisor of 4055)
...
4055 / 62 = 65.403225806452 (the remainder is 25, so 62 is not a divisor of 4055)
4055 / 63 = 64.365079365079 (the remainder is 23, so 63 is not a divisor of 4055)