What are the divisors of 2977?

1, 13, 229, 2977

There is a total of 4 positive divisors.
The sum of these divisors is 3220.
The arithmetic mean is 805.

4 odd divisors

1, 13, 229, 2977

How to compute the divisors of 2977?

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

2977 / 1 = 2977 (the remainder is 0, so 1 is a divisor of 2977)
2977 / 2 = 1488.5 (the remainder is 1, so 2 is not a divisor of 2977)
2977 / 3 = 992.33333333333 (the remainder is 1, so 3 is not a divisor of 2977)
...
2977 / 2976 = 1.0003360215054 (the remainder is 1, so 2976 is not a divisor of 2977)
2977 / 2977 = 1 (the remainder is 0, so 2977 is a divisor of 2977)

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 2977 (i.e. 54.561891462815). 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$ )

2977 / 1 = 2977 (the remainder is 0, so 1 and 2977 are divisors of 2977)
2977 / 2 = 1488.5 (the remainder is 1, so 2 is not a divisor of 2977)
2977 / 3 = 992.33333333333 (the remainder is 1, so 3 is not a divisor of 2977)
...
2977 / 53 = 56.169811320755 (the remainder is 9, so 53 is not a divisor of 2977)
2977 / 54 = 55.12962962963 (the remainder is 7, so 54 is not a divisor of 2977)