What are the divisors of 4901?

1, 13, 29, 169, 377, 4901

There is a total of 6 positive divisors.
The sum of these divisors is 5490.
The arithmetic mean is 915.

6 odd divisors

1, 13, 29, 169, 377, 4901

How to compute the divisors of 4901?

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

4901 / 1 = 4901 (the remainder is 0, so 1 is a divisor of 4901)
4901 / 2 = 2450.5 (the remainder is 1, so 2 is not a divisor of 4901)
4901 / 3 = 1633.6666666667 (the remainder is 2, so 3 is not a divisor of 4901)
...
4901 / 4900 = 1.0002040816327 (the remainder is 1, so 4900 is not a divisor of 4901)
4901 / 4901 = 1 (the remainder is 0, so 4901 is a divisor of 4901)

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 4901 (i.e. 70.007142492749). 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$ )

4901 / 1 = 4901 (the remainder is 0, so 1 and 4901 are divisors of 4901)
4901 / 2 = 2450.5 (the remainder is 1, so 2 is not a divisor of 4901)
4901 / 3 = 1633.6666666667 (the remainder is 2, so 3 is not a divisor of 4901)
...
4901 / 69 = 71.028985507246 (the remainder is 2, so 69 is not a divisor of 4901)
4901 / 70 = 70.014285714286 (the remainder is 1, so 70 is not a divisor of 4901)