What are the divisors of 2447?
1, 2447
- There is a total of 2 positive divisors.
- The sum of these divisors is 2448.
- The arithmetic mean is 1224.
2 odd divisors
1, 2447
How to compute the divisors of 2447?
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 2447 by each of the numbers from 1 to 2447 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 2447 / 1 = 2447 (the remainder is 0, so 1 is a divisor of 2447)
- 2447 / 2 = 1223.5 (the remainder is 1, so 2 is not a divisor of 2447)
- 2447 / 3 = 815.66666666667 (the remainder is 2, so 3 is not a divisor of 2447)
- ...
- 2447 / 2446 = 1.0004088307441 (the remainder is 1, so 2446 is not a divisor of 2447)
- 2447 / 2447 = 1 (the remainder is 0, so 2447 is a divisor of 2447)
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 2447 (i.e. 49.467160824127). 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 )
- 2447 / 1 = 2447 (the remainder is 0, so 1 and 2447 are divisors of 2447)
- 2447 / 2 = 1223.5 (the remainder is 1, so 2 is not a divisor of 2447)
- 2447 / 3 = 815.66666666667 (the remainder is 2, so 3 is not a divisor of 2447)
- ...
- 2447 / 48 = 50.979166666667 (the remainder is 47, so 48 is not a divisor of 2447)
- 2447 / 49 = 49.938775510204 (the remainder is 46, so 49 is not a divisor of 2447)