What are the divisors of 1411?

1, 17, 83, 1411

There is a total of 4 positive divisors.
The sum of these divisors is 1512.
The arithmetic mean is 378.

4 odd divisors

1, 17, 83, 1411

How to compute the divisors of 1411?

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

1411 / 1 = 1411 (the remainder is 0, so 1 is a divisor of 1411)
1411 / 2 = 705.5 (the remainder is 1, so 2 is not a divisor of 1411)
1411 / 3 = 470.33333333333 (the remainder is 1, so 3 is not a divisor of 1411)
...
1411 / 1410 = 1.0007092198582 (the remainder is 1, so 1410 is not a divisor of 1411)
1411 / 1411 = 1 (the remainder is 0, so 1411 is a divisor of 1411)

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 1411 (i.e. 37.563279941986). 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$ )

1411 / 1 = 1411 (the remainder is 0, so 1 and 1411 are divisors of 1411)
1411 / 2 = 705.5 (the remainder is 1, so 2 is not a divisor of 1411)
1411 / 3 = 470.33333333333 (the remainder is 1, so 3 is not a divisor of 1411)
...
1411 / 36 = 39.194444444444 (the remainder is 7, so 36 is not a divisor of 1411)
1411 / 37 = 38.135135135135 (the remainder is 5, so 37 is not a divisor of 1411)