What are the divisors of 1513?

1, 17, 89, 1513

There is a total of 4 positive divisors.
The sum of these divisors is 1620.
The arithmetic mean is 405.

4 odd divisors

1, 17, 89, 1513

How to compute the divisors of 1513?

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

1513 / 1 = 1513 (the remainder is 0, so 1 is a divisor of 1513)
1513 / 2 = 756.5 (the remainder is 1, so 2 is not a divisor of 1513)
1513 / 3 = 504.33333333333 (the remainder is 1, so 3 is not a divisor of 1513)
...
1513 / 1512 = 1.0006613756614 (the remainder is 1, so 1512 is not a divisor of 1513)
1513 / 1513 = 1 (the remainder is 0, so 1513 is a divisor of 1513)

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 1513 (i.e. 38.897300677553). 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$ )

1513 / 1 = 1513 (the remainder is 0, so 1 and 1513 are divisors of 1513)
1513 / 2 = 756.5 (the remainder is 1, so 2 is not a divisor of 1513)
1513 / 3 = 504.33333333333 (the remainder is 1, so 3 is not a divisor of 1513)
...
1513 / 37 = 40.891891891892 (the remainder is 33, so 37 is not a divisor of 1513)
1513 / 38 = 39.815789473684 (the remainder is 31, so 38 is not a divisor of 1513)