What are the divisors of 1589?

1, 7, 227, 1589

There is a total of 4 positive divisors.
The sum of these divisors is 1824.
The arithmetic mean is 456.

4 odd divisors

1, 7, 227, 1589

How to compute the divisors of 1589?

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

1589 / 1 = 1589 (the remainder is 0, so 1 is a divisor of 1589)
1589 / 2 = 794.5 (the remainder is 1, so 2 is not a divisor of 1589)
1589 / 3 = 529.66666666667 (the remainder is 2, so 3 is not a divisor of 1589)
...
1589 / 1588 = 1.0006297229219 (the remainder is 1, so 1588 is not a divisor of 1589)
1589 / 1589 = 1 (the remainder is 0, so 1589 is a divisor of 1589)

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 1589 (i.e. 39.862262855989). 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$ )

1589 / 1 = 1589 (the remainder is 0, so 1 and 1589 are divisors of 1589)
1589 / 2 = 794.5 (the remainder is 1, so 2 is not a divisor of 1589)
1589 / 3 = 529.66666666667 (the remainder is 2, so 3 is not a divisor of 1589)
...
1589 / 38 = 41.815789473684 (the remainder is 31, so 38 is not a divisor of 1589)
1589 / 39 = 40.74358974359 (the remainder is 29, so 39 is not a divisor of 1589)