What are the divisors of 4829?

1, 11, 439, 4829

There is a total of 4 positive divisors.
The sum of these divisors is 5280.
The arithmetic mean is 1320.

4 odd divisors

1, 11, 439, 4829

How to compute the divisors of 4829?

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

4829 / 1 = 4829 (the remainder is 0, so 1 is a divisor of 4829)
4829 / 2 = 2414.5 (the remainder is 1, so 2 is not a divisor of 4829)
4829 / 3 = 1609.6666666667 (the remainder is 2, so 3 is not a divisor of 4829)
...
4829 / 4828 = 1.0002071251036 (the remainder is 1, so 4828 is not a divisor of 4829)
4829 / 4829 = 1 (the remainder is 0, so 4829 is a divisor of 4829)

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 4829 (i.e. 69.491006612367). 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$ )

4829 / 1 = 4829 (the remainder is 0, so 1 and 4829 are divisors of 4829)
4829 / 2 = 2414.5 (the remainder is 1, so 2 is not a divisor of 4829)
4829 / 3 = 1609.6666666667 (the remainder is 2, so 3 is not a divisor of 4829)
...
4829 / 68 = 71.014705882353 (the remainder is 1, so 68 is not a divisor of 4829)
4829 / 69 = 69.985507246377 (the remainder is 68, so 69 is not a divisor of 4829)