What are the divisors of 4483?
1, 4483
- There is a total of 2 positive divisors.
- The sum of these divisors is 4484.
- The arithmetic mean is 2242.
2 odd divisors
1, 4483
How to compute the divisors of 4483?
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 4483 by each of the numbers from 1 to 4483 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 4483 / 1 = 4483 (the remainder is 0, so 1 is a divisor of 4483)
- 4483 / 2 = 2241.5 (the remainder is 1, so 2 is not a divisor of 4483)
- 4483 / 3 = 1494.3333333333 (the remainder is 1, so 3 is not a divisor of 4483)
- ...
- 4483 / 4482 = 1.0002231146809 (the remainder is 1, so 4482 is not a divisor of 4483)
- 4483 / 4483 = 1 (the remainder is 0, so 4483 is a divisor of 4483)
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 4483 (i.e. 66.955208908643). 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 )
- 4483 / 1 = 4483 (the remainder is 0, so 1 and 4483 are divisors of 4483)
- 4483 / 2 = 2241.5 (the remainder is 1, so 2 is not a divisor of 4483)
- 4483 / 3 = 1494.3333333333 (the remainder is 1, so 3 is not a divisor of 4483)
- ...
- 4483 / 65 = 68.969230769231 (the remainder is 63, so 65 is not a divisor of 4483)
- 4483 / 66 = 67.924242424242 (the remainder is 61, so 66 is not a divisor of 4483)