What are the divisors of 472?
1, 2, 4, 8, 59, 118, 236, 472
- There is a total of 8 positive divisors.
- The sum of these divisors is 900.
- The arithmetic mean is 112.5.
6 even divisors
2, 4, 8, 118, 236, 472
2 odd divisors
1, 59
How to compute the divisors of 472?
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.
Brute force algorithm
We could start by using a brute-force method which would involve dividing 472 by each of the numbers from 1 to 472 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 472 / 1 = 472 (the remainder is 0, so 1 is a divisor of 472)
- 472 / 2 = 236 (the remainder is 0, so 2 is a divisor of 472)
- 472 / 3 = 157.33333333333 (the remainder is 1, so 3 is not a divisor of 472)
- ...
- 472 / 471 = 1.0021231422505 (the remainder is 1, so 471 is not a divisor of 472)
- 472 / 472 = 1 (the remainder is 0, so 472 is a divisor of 472)
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 472 (i.e. 21.7255609824). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:
(thus, if , then )
- 472 / 1 = 472 (the remainder is 0, so 1 and 472 are divisors of 472)
- 472 / 2 = 236 (the remainder is 0, so 2 and 236 are divisors of 472)
- 472 / 3 = 157.33333333333 (the remainder is 1, so 3 is not a divisor of 472)
- ...
- 472 / 20 = 23.6 (the remainder is 12, so 20 is not a divisor of 472)
- 472 / 21 = 22.47619047619 (the remainder is 10, so 21 is not a divisor of 472)