What are the divisors of 2660?

1, 2, 4, 5, 7, 10, 14, 19, 20, 28, 35, 38, 70, 76, 95, 133, 140, 190, 266, 380, 532, 665, 1330, 2660

There is a total of 24 positive divisors.
The sum of these divisors is 6720.
The arithmetic mean is 280.

16 even divisors

2, 4, 10, 14, 20, 28, 38, 70, 76, 140, 190, 266, 380, 532, 1330, 2660

8 odd divisors

1, 5, 7, 19, 35, 95, 133, 665

How to compute the divisors of 2660?

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

2660 / 1 = 2660 (the remainder is 0, so 1 is a divisor of 2660)
2660 / 2 = 1330 (the remainder is 0, so 2 is a divisor of 2660)
2660 / 3 = 886.66666666667 (the remainder is 2, so 3 is not a divisor of 2660)
...
2660 / 2659 = 1.0003760812335 (the remainder is 1, so 2659 is not a divisor of 2660)
2660 / 2660 = 1 (the remainder is 0, so 2660 is a divisor of 2660)

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 2660 (i.e. 51.575187832911). 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$ )

2660 / 1 = 2660 (the remainder is 0, so 1 and 2660 are divisors of 2660)
2660 / 2 = 1330 (the remainder is 0, so 2 and 1330 are divisors of 2660)
2660 / 3 = 886.66666666667 (the remainder is 2, so 3 is not a divisor of 2660)
...
2660 / 50 = 53.2 (the remainder is 10, so 50 is not a divisor of 2660)
2660 / 51 = 52.156862745098 (the remainder is 8, so 51 is not a divisor of 2660)