What are the divisors of 3469?
1, 3469
- There is a total of 2 positive divisors.
- The sum of these divisors is 3470.
- The arithmetic mean is 1735.
2 odd divisors
1, 3469
How to compute the divisors of 3469?
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 3469 by each of the numbers from 1 to 3469 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 3469 / 1 = 3469 (the remainder is 0, so 1 is a divisor of 3469)
- 3469 / 2 = 1734.5 (the remainder is 1, so 2 is not a divisor of 3469)
- 3469 / 3 = 1156.3333333333 (the remainder is 1, so 3 is not a divisor of 3469)
- ...
- 3469 / 3468 = 1.0002883506344 (the remainder is 1, so 3468 is not a divisor of 3469)
- 3469 / 3469 = 1 (the remainder is 0, so 3469 is a divisor of 3469)
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 3469 (i.e. 58.898217290509). 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 )
- 3469 / 1 = 3469 (the remainder is 0, so 1 and 3469 are divisors of 3469)
- 3469 / 2 = 1734.5 (the remainder is 1, so 2 is not a divisor of 3469)
- 3469 / 3 = 1156.3333333333 (the remainder is 1, so 3 is not a divisor of 3469)
- ...
- 3469 / 57 = 60.859649122807 (the remainder is 49, so 57 is not a divisor of 3469)
- 3469 / 58 = 59.810344827586 (the remainder is 47, so 58 is not a divisor of 3469)