What are the divisors of 9605?

1, 5, 17, 85, 113, 565, 1921, 9605

There is a total of 8 positive divisors.
The sum of these divisors is 12312.
The arithmetic mean is 1539.

8 odd divisors

1, 5, 17, 85, 113, 565, 1921, 9605

How to compute the divisors of 9605?

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

9605 / 1 = 9605 (the remainder is 0, so 1 is a divisor of 9605)
9605 / 2 = 4802.5 (the remainder is 1, so 2 is not a divisor of 9605)
9605 / 3 = 3201.6666666667 (the remainder is 2, so 3 is not a divisor of 9605)
...
9605 / 9604 = 1.000104123282 (the remainder is 1, so 9604 is not a divisor of 9605)
9605 / 9605 = 1 (the remainder is 0, so 9605 is a divisor of 9605)

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 9605 (i.e. 98.005101908013). 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$ )

9605 / 1 = 9605 (the remainder is 0, so 1 and 9605 are divisors of 9605)
9605 / 2 = 4802.5 (the remainder is 1, so 2 is not a divisor of 9605)
9605 / 3 = 3201.6666666667 (the remainder is 2, so 3 is not a divisor of 9605)
...
9605 / 97 = 99.020618556701 (the remainder is 2, so 97 is not a divisor of 9605)
9605 / 98 = 98.010204081633 (the remainder is 1, so 98 is not a divisor of 9605)