What are the divisors of 1574?

1, 2, 787, 1574

There is a total of 4 positive divisors.
The sum of these divisors is 2364.
The arithmetic mean is 591.

2 even divisors

2, 1574

2 odd divisors

1, 787

How to compute the divisors of 1574?

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

1574 / 1 = 1574 (the remainder is 0, so 1 is a divisor of 1574)
1574 / 2 = 787 (the remainder is 0, so 2 is a divisor of 1574)
1574 / 3 = 524.66666666667 (the remainder is 2, so 3 is not a divisor of 1574)
...
1574 / 1573 = 1.0006357279085 (the remainder is 1, so 1573 is not a divisor of 1574)
1574 / 1574 = 1 (the remainder is 0, so 1574 is a divisor of 1574)

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 1574 (i.e. 39.673668849755). 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$ )

1574 / 1 = 1574 (the remainder is 0, so 1 and 1574 are divisors of 1574)
1574 / 2 = 787 (the remainder is 0, so 2 and 787 are divisors of 1574)
1574 / 3 = 524.66666666667 (the remainder is 2, so 3 is not a divisor of 1574)
...
1574 / 38 = 41.421052631579 (the remainder is 16, so 38 is not a divisor of 1574)
1574 / 39 = 40.358974358974 (the remainder is 14, so 39 is not a divisor of 1574)