What are the divisors of 3830?

1, 2, 5, 10, 383, 766, 1915, 3830

There is a total of 8 positive divisors.
The sum of these divisors is 6912.
The arithmetic mean is 864.

4 even divisors

2, 10, 766, 3830

4 odd divisors

1, 5, 383, 1915

How to compute the divisors of 3830?

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

3830 / 1 = 3830 (the remainder is 0, so 1 is a divisor of 3830)
3830 / 2 = 1915 (the remainder is 0, so 2 is a divisor of 3830)
3830 / 3 = 1276.6666666667 (the remainder is 2, so 3 is not a divisor of 3830)
...
3830 / 3829 = 1.000261164795 (the remainder is 1, so 3829 is not a divisor of 3830)
3830 / 3830 = 1 (the remainder is 0, so 3830 is a divisor of 3830)

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 3830 (i.e. 61.886993787063). 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$ )

3830 / 1 = 3830 (the remainder is 0, so 1 and 3830 are divisors of 3830)
3830 / 2 = 1915 (the remainder is 0, so 2 and 1915 are divisors of 3830)
3830 / 3 = 1276.6666666667 (the remainder is 2, so 3 is not a divisor of 3830)
...
3830 / 60 = 63.833333333333 (the remainder is 50, so 60 is not a divisor of 3830)
3830 / 61 = 62.786885245902 (the remainder is 48, so 61 is not a divisor of 3830)