What are the divisors of 1096?

1, 2, 4, 8, 137, 274, 548, 1096

There is a total of 8 positive divisors.
The sum of these divisors is 2070.
The arithmetic mean is 258.75.

6 even divisors

2, 4, 8, 274, 548, 1096

2 odd divisors

1, 137

How to compute the divisors of 1096?

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

1096 / 1 = 1096 (the remainder is 0, so 1 is a divisor of 1096)
1096 / 2 = 548 (the remainder is 0, so 2 is a divisor of 1096)
1096 / 3 = 365.33333333333 (the remainder is 1, so 3 is not a divisor of 1096)
...
1096 / 1095 = 1.0009132420091 (the remainder is 1, so 1095 is not a divisor of 1096)
1096 / 1096 = 1 (the remainder is 0, so 1096 is a divisor of 1096)

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 1096 (i.e. 33.105890714494). 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$ )

1096 / 1 = 1096 (the remainder is 0, so 1 and 1096 are divisors of 1096)
1096 / 2 = 548 (the remainder is 0, so 2 and 548 are divisors of 1096)
1096 / 3 = 365.33333333333 (the remainder is 1, so 3 is not a divisor of 1096)
...
1096 / 32 = 34.25 (the remainder is 8, so 32 is not a divisor of 1096)
1096 / 33 = 33.212121212121 (the remainder is 7, so 33 is not a divisor of 1096)