What are the divisors of 4909?
1, 4909
- There is a total of 2 positive divisors.
- The sum of these divisors is 4910.
- The arithmetic mean is 2455.
2 odd divisors
1, 4909
How to compute the divisors of 4909?
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 4909 by each of the numbers from 1 to 4909 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 4909 / 1 = 4909 (the remainder is 0, so 1 is a divisor of 4909)
- 4909 / 2 = 2454.5 (the remainder is 1, so 2 is not a divisor of 4909)
- 4909 / 3 = 1636.3333333333 (the remainder is 1, so 3 is not a divisor of 4909)
- ...
- 4909 / 4908 = 1.0002037489813 (the remainder is 1, so 4908 is not a divisor of 4909)
- 4909 / 4909 = 1 (the remainder is 0, so 4909 is a divisor of 4909)
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 4909 (i.e. 70.064256222413). 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 )
- 4909 / 1 = 4909 (the remainder is 0, so 1 and 4909 are divisors of 4909)
- 4909 / 2 = 2454.5 (the remainder is 1, so 2 is not a divisor of 4909)
- 4909 / 3 = 1636.3333333333 (the remainder is 1, so 3 is not a divisor of 4909)
- ...
- 4909 / 69 = 71.144927536232 (the remainder is 10, so 69 is not a divisor of 4909)
- 4909 / 70 = 70.128571428571 (the remainder is 9, so 70 is not a divisor of 4909)