What are the divisors of 4983?

1, 3, 11, 33, 151, 453, 1661, 4983

There is a total of 8 positive divisors.
The sum of these divisors is 7296.
The arithmetic mean is 912.

8 odd divisors

1, 3, 11, 33, 151, 453, 1661, 4983

How to compute the divisors of 4983?

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

4983 / 1 = 4983 (the remainder is 0, so 1 is a divisor of 4983)
4983 / 2 = 2491.5 (the remainder is 1, so 2 is not a divisor of 4983)
4983 / 3 = 1661 (the remainder is 0, so 3 is a divisor of 4983)
...
4983 / 4982 = 1.0002007226014 (the remainder is 1, so 4982 is not a divisor of 4983)
4983 / 4983 = 1 (the remainder is 0, so 4983 is a divisor of 4983)

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 4983 (i.e. 70.590367614852). 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$ )

4983 / 1 = 4983 (the remainder is 0, so 1 and 4983 are divisors of 4983)
4983 / 2 = 2491.5 (the remainder is 1, so 2 is not a divisor of 4983)
4983 / 3 = 1661 (the remainder is 0, so 3 and 1661 are divisors of 4983)
...
4983 / 69 = 72.217391304348 (the remainder is 15, so 69 is not a divisor of 4983)
4983 / 70 = 71.185714285714 (the remainder is 13, so 70 is not a divisor of 4983)