What are the divisors of 4573?

1, 17, 269, 4573

There is a total of 4 positive divisors.
The sum of these divisors is 4860.
The arithmetic mean is 1215.

4 odd divisors

1, 17, 269, 4573

How to compute the divisors of 4573?

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

4573 / 1 = 4573 (the remainder is 0, so 1 is a divisor of 4573)
4573 / 2 = 2286.5 (the remainder is 1, so 2 is not a divisor of 4573)
4573 / 3 = 1524.3333333333 (the remainder is 1, so 3 is not a divisor of 4573)
...
4573 / 4572 = 1.0002187226597 (the remainder is 1, so 4572 is not a divisor of 4573)
4573 / 4573 = 1 (the remainder is 0, so 4573 is a divisor of 4573)

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 4573 (i.e. 67.623960250787). 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$ )

4573 / 1 = 4573 (the remainder is 0, so 1 and 4573 are divisors of 4573)
4573 / 2 = 2286.5 (the remainder is 1, so 2 is not a divisor of 4573)
4573 / 3 = 1524.3333333333 (the remainder is 1, so 3 is not a divisor of 4573)
...
4573 / 66 = 69.287878787879 (the remainder is 19, so 66 is not a divisor of 4573)
4573 / 67 = 68.253731343284 (the remainder is 17, so 67 is not a divisor of 4573)