What are the divisors of 1494?

1, 2, 3, 6, 9, 18, 83, 166, 249, 498, 747, 1494

There is a total of 12 positive divisors.
The sum of these divisors is 3276.
The arithmetic mean is 273.

6 even divisors

2, 6, 18, 166, 498, 1494

6 odd divisors

1, 3, 9, 83, 249, 747

How to compute the divisors of 1494?

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

1494 / 1 = 1494 (the remainder is 0, so 1 is a divisor of 1494)
1494 / 2 = 747 (the remainder is 0, so 2 is a divisor of 1494)
1494 / 3 = 498 (the remainder is 0, so 3 is a divisor of 1494)
...
1494 / 1493 = 1.0006697923644 (the remainder is 1, so 1493 is not a divisor of 1494)
1494 / 1494 = 1 (the remainder is 0, so 1494 is a divisor of 1494)

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 1494 (i.e. 38.652296180175). 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$ )

1494 / 1 = 1494 (the remainder is 0, so 1 and 1494 are divisors of 1494)
1494 / 2 = 747 (the remainder is 0, so 2 and 747 are divisors of 1494)
1494 / 3 = 498 (the remainder is 0, so 3 and 498 are divisors of 1494)
...
1494 / 37 = 40.378378378378 (the remainder is 14, so 37 is not a divisor of 1494)
1494 / 38 = 39.315789473684 (the remainder is 12, so 38 is not a divisor of 1494)