What are the divisors of 8101?
1, 8101
- There is a total of 2 positive divisors.
- The sum of these divisors is 8102.
- The arithmetic mean is 4051.
2 odd divisors
1, 8101
How to compute the divisors of 8101?
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 8101 by each of the numbers from 1 to 8101 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 8101 / 1 = 8101 (the remainder is 0, so 1 is a divisor of 8101)
- 8101 / 2 = 4050.5 (the remainder is 1, so 2 is not a divisor of 8101)
- 8101 / 3 = 2700.3333333333 (the remainder is 1, so 3 is not a divisor of 8101)
- ...
- 8101 / 8100 = 1.0001234567901 (the remainder is 1, so 8100 is not a divisor of 8101)
- 8101 / 8101 = 1 (the remainder is 0, so 8101 is a divisor of 8101)
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 8101 (i.e. 90.005555384098). 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 )
- 8101 / 1 = 8101 (the remainder is 0, so 1 and 8101 are divisors of 8101)
- 8101 / 2 = 4050.5 (the remainder is 1, so 2 is not a divisor of 8101)
- 8101 / 3 = 2700.3333333333 (the remainder is 1, so 3 is not a divisor of 8101)
- ...
- 8101 / 89 = 91.022471910112 (the remainder is 2, so 89 is not a divisor of 8101)
- 8101 / 90 = 90.011111111111 (the remainder is 1, so 90 is not a divisor of 8101)