What are the divisors of 5431?
1, 5431
- There is a total of 2 positive divisors.
- The sum of these divisors is 5432.
- The arithmetic mean is 2716.
2 odd divisors
1, 5431
How to compute the divisors of 5431?
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 5431 by each of the numbers from 1 to 5431 to determine which ones have a remainder equal to 0.
(where is the integer part of the quotient)
- 5431 / 1 = 5431 (the remainder is 0, so 1 is a divisor of 5431)
- 5431 / 2 = 2715.5 (the remainder is 1, so 2 is not a divisor of 5431)
- 5431 / 3 = 1810.3333333333 (the remainder is 1, so 3 is not a divisor of 5431)
- ...
- 5431 / 5430 = 1.0001841620626 (the remainder is 1, so 5430 is not a divisor of 5431)
- 5431 / 5431 = 1 (the remainder is 0, so 5431 is a divisor of 5431)
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 5431 (i.e. 73.695318711571). 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 )
- 5431 / 1 = 5431 (the remainder is 0, so 1 and 5431 are divisors of 5431)
- 5431 / 2 = 2715.5 (the remainder is 1, so 2 is not a divisor of 5431)
- 5431 / 3 = 1810.3333333333 (the remainder is 1, so 3 is not a divisor of 5431)
- ...
- 5431 / 72 = 75.430555555556 (the remainder is 31, so 72 is not a divisor of 5431)
- 5431 / 73 = 74.397260273973 (the remainder is 29, so 73 is not a divisor of 5431)