What are the divisors of 4296?

1, 2, 3, 4, 6, 8, 12, 24, 179, 358, 537, 716, 1074, 1432, 2148, 4296

There is a total of 16 positive divisors.
The sum of these divisors is 10800.
The arithmetic mean is 675.

12 even divisors

2, 4, 6, 8, 12, 24, 358, 716, 1074, 1432, 2148, 4296

4 odd divisors

1, 3, 179, 537

How to compute the divisors of 4296?

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

4296 / 1 = 4296 (the remainder is 0, so 1 is a divisor of 4296)
4296 / 2 = 2148 (the remainder is 0, so 2 is a divisor of 4296)
4296 / 3 = 1432 (the remainder is 0, so 3 is a divisor of 4296)
...
4296 / 4295 = 1.0002328288708 (the remainder is 1, so 4295 is not a divisor of 4296)
4296 / 4296 = 1 (the remainder is 0, so 4296 is a divisor of 4296)

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 4296 (i.e. 65.543878432696). 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$ )

4296 / 1 = 4296 (the remainder is 0, so 1 and 4296 are divisors of 4296)
4296 / 2 = 2148 (the remainder is 0, so 2 and 2148 are divisors of 4296)
4296 / 3 = 1432 (the remainder is 0, so 3 and 1432 are divisors of 4296)
...
4296 / 64 = 67.125 (the remainder is 8, so 64 is not a divisor of 4296)
4296 / 65 = 66.092307692308 (the remainder is 6, so 65 is not a divisor of 4296)