What are the divisors of 5947?

1, 19, 313, 5947

There is a total of 4 positive divisors.
The sum of these divisors is 6280.
The arithmetic mean is 1570.

4 odd divisors

1, 19, 313, 5947

How to compute the divisors of 5947?

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.

$N mod M = 0$

Brute force algorithm

We could start by using a brute-force method which would involve dividing 5947 by each of the numbers from 1 to 5947 to determine which ones have a remainder equal to 0.

$Remainder = N - (M \times ⌊ \frac{N}{M} ⌋)$

(where $⌊ \frac{N}{M} ⌋$ is the integer part of the quotient)

5947 / 1 = 5947 (the remainder is 0, so 1 is a divisor of 5947)
5947 / 2 = 2973.5 (the remainder is 1, so 2 is not a divisor of 5947)
5947 / 3 = 1982.3333333333 (the remainder is 1, so 3 is not a divisor of 5947)
...
5947 / 5946 = 1.0001681802893 (the remainder is 1, so 5946 is not a divisor of 5947)
5947 / 5947 = 1 (the remainder is 0, so 5947 is a divisor of 5947)

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 5947 (i.e. 77.116794539192). Indeed, if a number N has a divisor D greater than its square root, then there is necessarily a smaller divisor d such that:

$D \times d = N$

(thus, if $\frac{N}{D} = d$ , then $\frac{N}{d} = D$ )

5947 / 1 = 5947 (the remainder is 0, so 1 and 5947 are divisors of 5947)
5947 / 2 = 2973.5 (the remainder is 1, so 2 is not a divisor of 5947)
5947 / 3 = 1982.3333333333 (the remainder is 1, so 3 is not a divisor of 5947)
...
5947 / 76 = 78.25 (the remainder is 19, so 76 is not a divisor of 5947)
5947 / 77 = 77.233766233766 (the remainder is 18, so 77 is not a divisor of 5947)