What are the divisors of 1466?

1, 2, 733, 1466

There is a total of 4 positive divisors.
The sum of these divisors is 2202.
The arithmetic mean is 550.5.

2 even divisors

2, 1466

2 odd divisors

1, 733

How to compute the divisors of 1466?

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

1466 / 1 = 1466 (the remainder is 0, so 1 is a divisor of 1466)
1466 / 2 = 733 (the remainder is 0, so 2 is a divisor of 1466)
1466 / 3 = 488.66666666667 (the remainder is 2, so 3 is not a divisor of 1466)
...
1466 / 1465 = 1.0006825938567 (the remainder is 1, so 1465 is not a divisor of 1466)
1466 / 1466 = 1 (the remainder is 0, so 1466 is a divisor of 1466)

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 1466 (i.e. 38.288379438153). 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$ )

1466 / 1 = 1466 (the remainder is 0, so 1 and 1466 are divisors of 1466)
1466 / 2 = 733 (the remainder is 0, so 2 and 733 are divisors of 1466)
1466 / 3 = 488.66666666667 (the remainder is 2, so 3 is not a divisor of 1466)
...
1466 / 37 = 39.621621621622 (the remainder is 23, so 37 is not a divisor of 1466)
1466 / 38 = 38.578947368421 (the remainder is 22, so 38 is not a divisor of 1466)