What are the divisors of 5619?
1, 3, 1873, 5619
- There is a total of 4 positive divisors.
- The sum of these divisors is 7496.
- The arithmetic mean is 1874.
4 odd divisors
1, 3, 1873, 5619
How to compute the divisors of 5619?
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 5619 by each of the numbers from 1 to 5619 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 5619 / 1 = 5619 (the remainder is 0, so 1 is a divisor of 5619)
- 5619 / 2 = 2809.5 (the remainder is 1, so 2 is not a divisor of 5619)
- 5619 / 3 = 1873 (the remainder is 0, so 3 is a divisor of 5619)
- ...
- 5619 / 5618 = 1.000177999288 (the remainder is 1, so 5618 is not a divisor of 5619)
- 5619 / 5619 = 1 (the remainder is 0, so 5619 is a divisor of 5619)
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 5619 (i.e. 74.959989327641). 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 )
- 5619 / 1 = 5619 (the remainder is 0, so 1 and 5619 are divisors of 5619)
- 5619 / 2 = 2809.5 (the remainder is 1, so 2 is not a divisor of 5619)
- 5619 / 3 = 1873 (the remainder is 0, so 3 and 1873 are divisors of 5619)
- ...
- 5619 / 73 = 76.972602739726 (the remainder is 71, so 73 is not a divisor of 5619)
- 5619 / 74 = 75.932432432432 (the remainder is 69, so 74 is not a divisor of 5619)