What are the divisors of 5593?

1, 7, 17, 47, 119, 329, 799, 5593

There is a total of 8 positive divisors.
The sum of these divisors is 6912.
The arithmetic mean is 864.

8 odd divisors

1, 7, 17, 47, 119, 329, 799, 5593

How to compute the divisors of 5593?

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

5593 / 1 = 5593 (the remainder is 0, so 1 is a divisor of 5593)
5593 / 2 = 2796.5 (the remainder is 1, so 2 is not a divisor of 5593)
5593 / 3 = 1864.3333333333 (the remainder is 1, so 3 is not a divisor of 5593)
...
5593 / 5592 = 1.0001788268956 (the remainder is 1, so 5592 is not a divisor of 5593)
5593 / 5593 = 1 (the remainder is 0, so 5593 is a divisor of 5593)

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 5593 (i.e. 74.786362393153). 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$ )

5593 / 1 = 5593 (the remainder is 0, so 1 and 5593 are divisors of 5593)
5593 / 2 = 2796.5 (the remainder is 1, so 2 is not a divisor of 5593)
5593 / 3 = 1864.3333333333 (the remainder is 1, so 3 is not a divisor of 5593)
...
5593 / 73 = 76.616438356164 (the remainder is 45, so 73 is not a divisor of 5593)
5593 / 74 = 75.581081081081 (the remainder is 43, so 74 is not a divisor of 5593)