What are the divisors of 32?

1, 2, 4, 8, 16, 32

There is a total of 6 positive divisors.
The sum of these divisors is 63.
The arithmetic mean is 10.5.

5 even divisors

2, 4, 8, 16, 32

1 odd divisors

How to compute the divisors of 32?

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

32 / 1 = 32 (the remainder is 0, so 1 is a divisor of 32)
32 / 2 = 16 (the remainder is 0, so 2 is a divisor of 32)
32 / 3 = 10.666666666667 (the remainder is 2, so 3 is not a divisor of 32)
...
32 / 31 = 1.0322580645161 (the remainder is 1, so 31 is not a divisor of 32)
32 / 32 = 1 (the remainder is 0, so 32 is a divisor of 32)

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 32 (i.e. 5.6568542494924). 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$ )

32 / 1 = 32 (the remainder is 0, so 1 and 32 are divisors of 32)
32 / 2 = 16 (the remainder is 0, so 2 and 16 are divisors of 32)
32 / 3 = 10.666666666667 (the remainder is 2, so 3 is not a divisor of 32)
...
32 / 4 = 8 (the remainder is 0, so 4 and 8 are divisors of 32)
32 / 5 = 6.4 (the remainder is 2, so 5 is not a divisor of 32)