What are the divisors of 3613?
1, 3613
- There is a total of 2 positive divisors.
- The sum of these divisors is 3614.
- The arithmetic mean is 1807.
2 odd divisors
1, 3613
How to compute the divisors of 3613?
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 3613 by each of the numbers from 1 to 3613 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 3613 / 1 = 3613 (the remainder is 0, so 1 is a divisor of 3613)
- 3613 / 2 = 1806.5 (the remainder is 1, so 2 is not a divisor of 3613)
- 3613 / 3 = 1204.3333333333 (the remainder is 1, so 3 is not a divisor of 3613)
- ...
- 3613 / 3612 = 1.000276854928 (the remainder is 1, so 3612 is not a divisor of 3613)
- 3613 / 3613 = 1 (the remainder is 0, so 3613 is a divisor of 3613)
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 3613 (i.e. 60.108235708595). 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 )
- 3613 / 1 = 3613 (the remainder is 0, so 1 and 3613 are divisors of 3613)
- 3613 / 2 = 1806.5 (the remainder is 1, so 2 is not a divisor of 3613)
- 3613 / 3 = 1204.3333333333 (the remainder is 1, so 3 is not a divisor of 3613)
- ...
- 3613 / 59 = 61.237288135593 (the remainder is 14, so 59 is not a divisor of 3613)
- 3613 / 60 = 60.216666666667 (the remainder is 13, so 60 is not a divisor of 3613)