What are the divisors of 5606?

1, 2, 2803, 5606

There is a total of 4 positive divisors.
The sum of these divisors is 8412.
The arithmetic mean is 2103.

2 even divisors

2, 5606

2 odd divisors

1, 2803

How to compute the divisors of 5606?

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

5606 / 1 = 5606 (the remainder is 0, so 1 is a divisor of 5606)
5606 / 2 = 2803 (the remainder is 0, so 2 is a divisor of 5606)
5606 / 3 = 1868.6666666667 (the remainder is 2, so 3 is not a divisor of 5606)
...
5606 / 5605 = 1.000178412132 (the remainder is 1, so 5605 is not a divisor of 5606)
5606 / 5606 = 1 (the remainder is 0, so 5606 is a divisor of 5606)

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 5606 (i.e. 74.87322618934). 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$ )

5606 / 1 = 5606 (the remainder is 0, so 1 and 5606 are divisors of 5606)
5606 / 2 = 2803 (the remainder is 0, so 2 and 2803 are divisors of 5606)
5606 / 3 = 1868.6666666667 (the remainder is 2, so 3 is not a divisor of 5606)
...
5606 / 73 = 76.794520547945 (the remainder is 58, so 73 is not a divisor of 5606)
5606 / 74 = 75.756756756757 (the remainder is 56, so 74 is not a divisor of 5606)