What are the divisors of 2272?

1, 2, 4, 8, 16, 32, 71, 142, 284, 568, 1136, 2272

There is a total of 12 positive divisors.
The sum of these divisors is 4536.
The arithmetic mean is 378.

10 even divisors

2, 4, 8, 16, 32, 142, 284, 568, 1136, 2272

2 odd divisors

1, 71

How to compute the divisors of 2272?

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

2272 / 1 = 2272 (the remainder is 0, so 1 is a divisor of 2272)
2272 / 2 = 1136 (the remainder is 0, so 2 is a divisor of 2272)
2272 / 3 = 757.33333333333 (the remainder is 1, so 3 is not a divisor of 2272)
...
2272 / 2271 = 1.0004403346543 (the remainder is 1, so 2271 is not a divisor of 2272)
2272 / 2272 = 1 (the remainder is 0, so 2272 is a divisor of 2272)

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 2272 (i.e. 47.665501151252). 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$ )

2272 / 1 = 2272 (the remainder is 0, so 1 and 2272 are divisors of 2272)
2272 / 2 = 1136 (the remainder is 0, so 2 and 1136 are divisors of 2272)
2272 / 3 = 757.33333333333 (the remainder is 1, so 3 is not a divisor of 2272)
...
2272 / 46 = 49.391304347826 (the remainder is 18, so 46 is not a divisor of 2272)
2272 / 47 = 48.340425531915 (the remainder is 16, so 47 is not a divisor of 2272)