What are the divisors of 4463?
1, 4463
- There is a total of 2 positive divisors.
- The sum of these divisors is 4464.
- The arithmetic mean is 2232.
2 odd divisors
1, 4463
How to compute the divisors of 4463?
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 4463 by each of the numbers from 1 to 4463 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 4463 / 1 = 4463 (the remainder is 0, so 1 is a divisor of 4463)
- 4463 / 2 = 2231.5 (the remainder is 1, so 2 is not a divisor of 4463)
- 4463 / 3 = 1487.6666666667 (the remainder is 2, so 3 is not a divisor of 4463)
- ...
- 4463 / 4462 = 1.0002241147468 (the remainder is 1, so 4462 is not a divisor of 4463)
- 4463 / 4463 = 1 (the remainder is 0, so 4463 is a divisor of 4463)
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 4463 (i.e. 66.805688380556). 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 )
- 4463 / 1 = 4463 (the remainder is 0, so 1 and 4463 are divisors of 4463)
- 4463 / 2 = 2231.5 (the remainder is 1, so 2 is not a divisor of 4463)
- 4463 / 3 = 1487.6666666667 (the remainder is 2, so 3 is not a divisor of 4463)
- ...
- 4463 / 65 = 68.661538461538 (the remainder is 43, so 65 is not a divisor of 4463)
- 4463 / 66 = 67.621212121212 (the remainder is 41, so 66 is not a divisor of 4463)