What are the divisors of 4570?

1, 2, 5, 10, 457, 914, 2285, 4570

There is a total of 8 positive divisors.
The sum of these divisors is 8244.
The arithmetic mean is 1030.5.

4 even divisors

2, 10, 914, 4570

4 odd divisors

1, 5, 457, 2285

How to compute the divisors of 4570?

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

4570 / 1 = 4570 (the remainder is 0, so 1 is a divisor of 4570)
4570 / 2 = 2285 (the remainder is 0, so 2 is a divisor of 4570)
4570 / 3 = 1523.3333333333 (the remainder is 1, so 3 is not a divisor of 4570)
...
4570 / 4569 = 1.0002188662727 (the remainder is 1, so 4569 is not a divisor of 4570)
4570 / 4570 = 1 (the remainder is 0, so 4570 is a divisor of 4570)

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 4570 (i.e. 67.601775124622). 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$ )

4570 / 1 = 4570 (the remainder is 0, so 1 and 4570 are divisors of 4570)
4570 / 2 = 2285 (the remainder is 0, so 2 and 2285 are divisors of 4570)
4570 / 3 = 1523.3333333333 (the remainder is 1, so 3 is not a divisor of 4570)
...
4570 / 66 = 69.242424242424 (the remainder is 16, so 66 is not a divisor of 4570)
4570 / 67 = 68.208955223881 (the remainder is 14, so 67 is not a divisor of 4570)