What are the divisors of 1066?

1, 2, 13, 26, 41, 82, 533, 1066

There is a total of 8 positive divisors.
The sum of these divisors is 1764.
The arithmetic mean is 220.5.

4 even divisors

2, 26, 82, 1066

4 odd divisors

1, 13, 41, 533

How to compute the divisors of 1066?

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

1066 / 1 = 1066 (the remainder is 0, so 1 is a divisor of 1066)
1066 / 2 = 533 (the remainder is 0, so 2 is a divisor of 1066)
1066 / 3 = 355.33333333333 (the remainder is 1, so 3 is not a divisor of 1066)
...
1066 / 1065 = 1.0009389671362 (the remainder is 1, so 1065 is not a divisor of 1066)
1066 / 1066 = 1 (the remainder is 0, so 1066 is a divisor of 1066)

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 1066 (i.e. 32.649655434629). 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$ )

1066 / 1 = 1066 (the remainder is 0, so 1 and 1066 are divisors of 1066)
1066 / 2 = 533 (the remainder is 0, so 2 and 533 are divisors of 1066)
1066 / 3 = 355.33333333333 (the remainder is 1, so 3 is not a divisor of 1066)
...
1066 / 31 = 34.387096774194 (the remainder is 12, so 31 is not a divisor of 1066)
1066 / 32 = 33.3125 (the remainder is 10, so 32 is not a divisor of 1066)