What are the divisors of 4835?

1, 5, 967, 4835

There is a total of 4 positive divisors.
The sum of these divisors is 5808.
The arithmetic mean is 1452.

4 odd divisors

1, 5, 967, 4835

How to compute the divisors of 4835?

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

4835 / 1 = 4835 (the remainder is 0, so 1 is a divisor of 4835)
4835 / 2 = 2417.5 (the remainder is 1, so 2 is not a divisor of 4835)
4835 / 3 = 1611.6666666667 (the remainder is 2, so 3 is not a divisor of 4835)
...
4835 / 4834 = 1.0002068680182 (the remainder is 1, so 4834 is not a divisor of 4835)
4835 / 4835 = 1 (the remainder is 0, so 4835 is a divisor of 4835)

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 4835 (i.e. 69.53416426477). 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$ )

4835 / 1 = 4835 (the remainder is 0, so 1 and 4835 are divisors of 4835)
4835 / 2 = 2417.5 (the remainder is 1, so 2 is not a divisor of 4835)
4835 / 3 = 1611.6666666667 (the remainder is 2, so 3 is not a divisor of 4835)
...
4835 / 68 = 71.102941176471 (the remainder is 7, so 68 is not a divisor of 4835)
4835 / 69 = 70.072463768116 (the remainder is 5, so 69 is not a divisor of 4835)