What are the divisors of 6011?
1, 6011
- There is a total of 2 positive divisors.
- The sum of these divisors is 6012.
- The arithmetic mean is 3006.
2 odd divisors
1, 6011
How to compute the divisors of 6011?
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 6011 by each of the numbers from 1 to 6011 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 6011 / 1 = 6011 (the remainder is 0, so 1 is a divisor of 6011)
- 6011 / 2 = 3005.5 (the remainder is 1, so 2 is not a divisor of 6011)
- 6011 / 3 = 2003.6666666667 (the remainder is 2, so 3 is not a divisor of 6011)
- ...
- 6011 / 6010 = 1.0001663893511 (the remainder is 1, so 6010 is not a divisor of 6011)
- 6011 / 6011 = 1 (the remainder is 0, so 6011 is a divisor of 6011)
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 6011 (i.e. 77.530639104808). 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 )
- 6011 / 1 = 6011 (the remainder is 0, so 1 and 6011 are divisors of 6011)
- 6011 / 2 = 3005.5 (the remainder is 1, so 2 is not a divisor of 6011)
- 6011 / 3 = 2003.6666666667 (the remainder is 2, so 3 is not a divisor of 6011)
- ...
- 6011 / 76 = 79.092105263158 (the remainder is 7, so 76 is not a divisor of 6011)
- 6011 / 77 = 78.064935064935 (the remainder is 5, so 77 is not a divisor of 6011)