What are the divisors of 487?
1, 487
- There is a total of 2 positive divisors.
- The sum of these divisors is 488.
- The arithmetic mean is 244.
2 odd divisors
1, 487
How to compute the divisors of 487?
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 487 by each of the numbers from 1 to 487 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 487 / 1 = 487 (the remainder is 0, so 1 is a divisor of 487)
- 487 / 2 = 243.5 (the remainder is 1, so 2 is not a divisor of 487)
- 487 / 3 = 162.33333333333 (the remainder is 1, so 3 is not a divisor of 487)
- ...
- 487 / 486 = 1.0020576131687 (the remainder is 1, so 486 is not a divisor of 487)
- 487 / 487 = 1 (the remainder is 0, so 487 is a divisor of 487)
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 487 (i.e. 22.068076490714). 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 )
- 487 / 1 = 487 (the remainder is 0, so 1 and 487 are divisors of 487)
- 487 / 2 = 243.5 (the remainder is 1, so 2 is not a divisor of 487)
- 487 / 3 = 162.33333333333 (the remainder is 1, so 3 is not a divisor of 487)
- ...
- 487 / 21 = 23.190476190476 (the remainder is 4, so 21 is not a divisor of 487)
- 487 / 22 = 22.136363636364 (the remainder is 3, so 22 is not a divisor of 487)