What are the divisors of 1069?

1, 1069

There is a total of 2 positive divisors.
The sum of these divisors is 1070.
The arithmetic mean is 535.

2 odd divisors

1, 1069

How to compute the divisors of 1069?

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

1069 / 1 = 1069 (the remainder is 0, so 1 is a divisor of 1069)
1069 / 2 = 534.5 (the remainder is 1, so 2 is not a divisor of 1069)
1069 / 3 = 356.33333333333 (the remainder is 1, so 3 is not a divisor of 1069)
...
1069 / 1068 = 1.000936329588 (the remainder is 1, so 1068 is not a divisor of 1069)
1069 / 1069 = 1 (the remainder is 0, so 1069 is a divisor of 1069)

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 1069 (i.e. 32.695565448544). 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$ )

1069 / 1 = 1069 (the remainder is 0, so 1 and 1069 are divisors of 1069)
1069 / 2 = 534.5 (the remainder is 1, so 2 is not a divisor of 1069)
1069 / 3 = 356.33333333333 (the remainder is 1, so 3 is not a divisor of 1069)
...
1069 / 31 = 34.483870967742 (the remainder is 15, so 31 is not a divisor of 1069)
1069 / 32 = 33.40625 (the remainder is 13, so 32 is not a divisor of 1069)