What are the divisors of 5066?

1, 2, 17, 34, 149, 298, 2533, 5066

There is a total of 8 positive divisors.
The sum of these divisors is 8100.
The arithmetic mean is 1012.5.

4 even divisors

2, 34, 298, 5066

4 odd divisors

1, 17, 149, 2533

How to compute the divisors of 5066?

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

5066 / 1 = 5066 (the remainder is 0, so 1 is a divisor of 5066)
5066 / 2 = 2533 (the remainder is 0, so 2 is a divisor of 5066)
5066 / 3 = 1688.6666666667 (the remainder is 2, so 3 is not a divisor of 5066)
...
5066 / 5065 = 1.0001974333662 (the remainder is 1, so 5065 is not a divisor of 5066)
5066 / 5066 = 1 (the remainder is 0, so 5066 is a divisor of 5066)

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 5066 (i.e. 71.175838597097). 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$ )

5066 / 1 = 5066 (the remainder is 0, so 1 and 5066 are divisors of 5066)
5066 / 2 = 2533 (the remainder is 0, so 2 and 2533 are divisors of 5066)
5066 / 3 = 1688.6666666667 (the remainder is 2, so 3 is not a divisor of 5066)
...
5066 / 70 = 72.371428571429 (the remainder is 26, so 70 is not a divisor of 5066)
5066 / 71 = 71.352112676056 (the remainder is 25, so 71 is not a divisor of 5066)