What are the divisors of 9073?

1, 43, 211, 9073

There is a total of 4 positive divisors.
The sum of these divisors is 9328.
The arithmetic mean is 2332.

4 odd divisors

1, 43, 211, 9073

How to compute the divisors of 9073?

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

9073 / 1 = 9073 (the remainder is 0, so 1 is a divisor of 9073)
9073 / 2 = 4536.5 (the remainder is 1, so 2 is not a divisor of 9073)
9073 / 3 = 3024.3333333333 (the remainder is 1, so 3 is not a divisor of 9073)
...
9073 / 9072 = 1.0001102292769 (the remainder is 1, so 9072 is not a divisor of 9073)
9073 / 9073 = 1 (the remainder is 0, so 9073 is a divisor of 9073)

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 9073 (i.e. 95.25229656024). 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$ )

9073 / 1 = 9073 (the remainder is 0, so 1 and 9073 are divisors of 9073)
9073 / 2 = 4536.5 (the remainder is 1, so 2 is not a divisor of 9073)
9073 / 3 = 3024.3333333333 (the remainder is 1, so 3 is not a divisor of 9073)
...
9073 / 94 = 96.521276595745 (the remainder is 49, so 94 is not a divisor of 9073)
9073 / 95 = 95.505263157895 (the remainder is 48, so 95 is not a divisor of 9073)