What are the divisors of 1859?
1, 11, 13, 143, 169, 1859
- There is a total of 6 positive divisors.
- The sum of these divisors is 2196.
- The arithmetic mean is 366.
6 odd divisors
1, 11, 13, 143, 169, 1859
How to compute the divisors of 1859?
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 1859 by each of the numbers from 1 to 1859 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 1859 / 1 = 1859 (the remainder is 0, so 1 is a divisor of 1859)
- 1859 / 2 = 929.5 (the remainder is 1, so 2 is not a divisor of 1859)
- 1859 / 3 = 619.66666666667 (the remainder is 2, so 3 is not a divisor of 1859)
- ...
- 1859 / 1858 = 1.0005382131324 (the remainder is 1, so 1858 is not a divisor of 1859)
- 1859 / 1859 = 1 (the remainder is 0, so 1859 is a divisor of 1859)
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 1859 (i.e. 43.11612227462). 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 )
- 1859 / 1 = 1859 (the remainder is 0, so 1 and 1859 are divisors of 1859)
- 1859 / 2 = 929.5 (the remainder is 1, so 2 is not a divisor of 1859)
- 1859 / 3 = 619.66666666667 (the remainder is 2, so 3 is not a divisor of 1859)
- ...
- 1859 / 42 = 44.261904761905 (the remainder is 11, so 42 is not a divisor of 1859)
- 1859 / 43 = 43.232558139535 (the remainder is 10, so 43 is not a divisor of 1859)