What are the divisors of 5075?

1, 5, 7, 25, 29, 35, 145, 175, 203, 725, 1015, 5075

There is a total of 12 positive divisors.
The sum of these divisors is 7440.
The arithmetic mean is 620.

12 odd divisors

1, 5, 7, 25, 29, 35, 145, 175, 203, 725, 1015, 5075

How to compute the divisors of 5075?

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

5075 / 1 = 5075 (the remainder is 0, so 1 is a divisor of 5075)
5075 / 2 = 2537.5 (the remainder is 1, so 2 is not a divisor of 5075)
5075 / 3 = 1691.6666666667 (the remainder is 2, so 3 is not a divisor of 5075)
...
5075 / 5074 = 1.0001970831691 (the remainder is 1, so 5074 is not a divisor of 5075)
5075 / 5075 = 1 (the remainder is 0, so 5075 is a divisor of 5075)

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 5075 (i.e. 71.239034243875). 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$ )

5075 / 1 = 5075 (the remainder is 0, so 1 and 5075 are divisors of 5075)
5075 / 2 = 2537.5 (the remainder is 1, so 2 is not a divisor of 5075)
5075 / 3 = 1691.6666666667 (the remainder is 2, so 3 is not a divisor of 5075)
...
5075 / 70 = 72.5 (the remainder is 35, so 70 is not a divisor of 5075)
5075 / 71 = 71.478873239437 (the remainder is 34, so 71 is not a divisor of 5075)