What are the divisors of 4979?

1, 13, 383, 4979

There is a total of 4 positive divisors.
The sum of these divisors is 5376.
The arithmetic mean is 1344.

4 odd divisors

1, 13, 383, 4979

How to compute the divisors of 4979?

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

4979 / 1 = 4979 (the remainder is 0, so 1 is a divisor of 4979)
4979 / 2 = 2489.5 (the remainder is 1, so 2 is not a divisor of 4979)
4979 / 3 = 1659.6666666667 (the remainder is 2, so 3 is not a divisor of 4979)
...
4979 / 4978 = 1.0002008838891 (the remainder is 1, so 4978 is not a divisor of 4979)
4979 / 4979 = 1 (the remainder is 0, so 4979 is a divisor of 4979)

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 4979 (i.e. 70.562029449273). 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$ )

4979 / 1 = 4979 (the remainder is 0, so 1 and 4979 are divisors of 4979)
4979 / 2 = 2489.5 (the remainder is 1, so 2 is not a divisor of 4979)
4979 / 3 = 1659.6666666667 (the remainder is 2, so 3 is not a divisor of 4979)
...
4979 / 69 = 72.159420289855 (the remainder is 11, so 69 is not a divisor of 4979)
4979 / 70 = 71.128571428571 (the remainder is 9, so 70 is not a divisor of 4979)