What are the divisors of 2515?

1, 5, 503, 2515

There is a total of 4 positive divisors.
The sum of these divisors is 3024.
The arithmetic mean is 756.

4 odd divisors

1, 5, 503, 2515

How to compute the divisors of 2515?

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

2515 / 1 = 2515 (the remainder is 0, so 1 is a divisor of 2515)
2515 / 2 = 1257.5 (the remainder is 1, so 2 is not a divisor of 2515)
2515 / 3 = 838.33333333333 (the remainder is 1, so 3 is not a divisor of 2515)
...
2515 / 2514 = 1.0003977724741 (the remainder is 1, so 2514 is not a divisor of 2515)
2515 / 2515 = 1 (the remainder is 0, so 2515 is a divisor of 2515)

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 2515 (i.e. 50.149775672479). 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$ )

2515 / 1 = 2515 (the remainder is 0, so 1 and 2515 are divisors of 2515)
2515 / 2 = 1257.5 (the remainder is 1, so 2 is not a divisor of 2515)
2515 / 3 = 838.33333333333 (the remainder is 1, so 3 is not a divisor of 2515)
...
2515 / 49 = 51.326530612245 (the remainder is 16, so 49 is not a divisor of 2515)
2515 / 50 = 50.3 (the remainder is 15, so 50 is not a divisor of 2515)