What are the divisors of 2965?

1, 5, 593, 2965

There is a total of 4 positive divisors.
The sum of these divisors is 3564.
The arithmetic mean is 891.

4 odd divisors

1, 5, 593, 2965

How to compute the divisors of 2965?

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

2965 / 1 = 2965 (the remainder is 0, so 1 is a divisor of 2965)
2965 / 2 = 1482.5 (the remainder is 1, so 2 is not a divisor of 2965)
2965 / 3 = 988.33333333333 (the remainder is 1, so 3 is not a divisor of 2965)
...
2965 / 2964 = 1.0003373819163 (the remainder is 1, so 2964 is not a divisor of 2965)
2965 / 2965 = 1 (the remainder is 0, so 2965 is a divisor of 2965)

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 2965 (i.e. 54.451813560248). 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$ )

2965 / 1 = 2965 (the remainder is 0, so 1 and 2965 are divisors of 2965)
2965 / 2 = 1482.5 (the remainder is 1, so 2 is not a divisor of 2965)
2965 / 3 = 988.33333333333 (the remainder is 1, so 3 is not a divisor of 2965)
...
2965 / 53 = 55.943396226415 (the remainder is 50, so 53 is not a divisor of 2965)
2965 / 54 = 54.907407407407 (the remainder is 49, so 54 is not a divisor of 2965)