What are the divisors of 4019?
1, 4019
- There is a total of 2 positive divisors.
- The sum of these divisors is 4020.
- The arithmetic mean is 2010.
2 odd divisors
1, 4019
How to compute the divisors of 4019?
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 4019 by each of the numbers from 1 to 4019 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 4019 / 1 = 4019 (the remainder is 0, so 1 is a divisor of 4019)
- 4019 / 2 = 2009.5 (the remainder is 1, so 2 is not a divisor of 4019)
- 4019 / 3 = 1339.6666666667 (the remainder is 2, so 3 is not a divisor of 4019)
- ...
- 4019 / 4018 = 1.0002488800398 (the remainder is 1, so 4018 is not a divisor of 4019)
- 4019 / 4019 = 1 (the remainder is 0, so 4019 is a divisor of 4019)
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 4019 (i.e. 63.395583442382). 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 )
- 4019 / 1 = 4019 (the remainder is 0, so 1 and 4019 are divisors of 4019)
- 4019 / 2 = 2009.5 (the remainder is 1, so 2 is not a divisor of 4019)
- 4019 / 3 = 1339.6666666667 (the remainder is 2, so 3 is not a divisor of 4019)
- ...
- 4019 / 62 = 64.822580645161 (the remainder is 51, so 62 is not a divisor of 4019)
- 4019 / 63 = 63.793650793651 (the remainder is 50, so 63 is not a divisor of 4019)