What are the divisors of 4147?

1, 11, 13, 29, 143, 319, 377, 4147

There is a total of 8 positive divisors.
The sum of these divisors is 5040.
The arithmetic mean is 630.

8 odd divisors

1, 11, 13, 29, 143, 319, 377, 4147

How to compute the divisors of 4147?

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 4147 by each of the numbers from 1 to 4147 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)

4147 / 1 = 4147 (the remainder is 0, so 1 is a divisor of 4147)
4147 / 2 = 2073.5 (the remainder is 1, so 2 is not a divisor of 4147)
4147 / 3 = 1382.3333333333 (the remainder is 1, so 3 is not a divisor of 4147)
...
4147 / 4146 = 1.0002411963338 (the remainder is 1, so 4146 is not a divisor of 4147)
4147 / 4147 = 1 (the remainder is 0, so 4147 is a divisor of 4147)

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 4147 (i.e. 64.397204908288). 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$ )

4147 / 1 = 4147 (the remainder is 0, so 1 and 4147 are divisors of 4147)
4147 / 2 = 2073.5 (the remainder is 1, so 2 is not a divisor of 4147)
4147 / 3 = 1382.3333333333 (the remainder is 1, so 3 is not a divisor of 4147)
...
4147 / 63 = 65.825396825397 (the remainder is 52, so 63 is not a divisor of 4147)
4147 / 64 = 64.796875 (the remainder is 51, so 64 is not a divisor of 4147)