What are the divisors of 2959?

1, 11, 269, 2959

There is a total of 4 positive divisors.
The sum of these divisors is 3240.
The arithmetic mean is 810.

4 odd divisors

1, 11, 269, 2959

How to compute the divisors of 2959?

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

2959 / 1 = 2959 (the remainder is 0, so 1 is a divisor of 2959)
2959 / 2 = 1479.5 (the remainder is 1, so 2 is not a divisor of 2959)
2959 / 3 = 986.33333333333 (the remainder is 1, so 3 is not a divisor of 2959)
...
2959 / 2958 = 1.000338066261 (the remainder is 1, so 2958 is not a divisor of 2959)
2959 / 2959 = 1 (the remainder is 0, so 2959 is a divisor of 2959)

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 2959 (i.e. 54.396691075837). 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$ )

2959 / 1 = 2959 (the remainder is 0, so 1 and 2959 are divisors of 2959)
2959 / 2 = 1479.5 (the remainder is 1, so 2 is not a divisor of 2959)
2959 / 3 = 986.33333333333 (the remainder is 1, so 3 is not a divisor of 2959)
...
2959 / 53 = 55.830188679245 (the remainder is 44, so 53 is not a divisor of 2959)
2959 / 54 = 54.796296296296 (the remainder is 43, so 54 is not a divisor of 2959)