What are the divisors of 5668?

1, 2, 4, 13, 26, 52, 109, 218, 436, 1417, 2834, 5668

There is a total of 12 positive divisors.
The sum of these divisors is 10780.
The arithmetic mean is 898.33333333333.

8 even divisors

2, 4, 26, 52, 218, 436, 2834, 5668

4 odd divisors

1, 13, 109, 1417

How to compute the divisors of 5668?

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

5668 / 1 = 5668 (the remainder is 0, so 1 is a divisor of 5668)
5668 / 2 = 2834 (the remainder is 0, so 2 is a divisor of 5668)
5668 / 3 = 1889.3333333333 (the remainder is 1, so 3 is not a divisor of 5668)
...
5668 / 5667 = 1.0001764602082 (the remainder is 1, so 5667 is not a divisor of 5668)
5668 / 5668 = 1 (the remainder is 0, so 5668 is a divisor of 5668)

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 5668 (i.e. 75.286120898875). 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$ )

5668 / 1 = 5668 (the remainder is 0, so 1 and 5668 are divisors of 5668)
5668 / 2 = 2834 (the remainder is 0, so 2 and 2834 are divisors of 5668)
5668 / 3 = 1889.3333333333 (the remainder is 1, so 3 is not a divisor of 5668)
...
5668 / 74 = 76.594594594595 (the remainder is 44, so 74 is not a divisor of 5668)
5668 / 75 = 75.573333333333 (the remainder is 43, so 75 is not a divisor of 5668)