What are the divisors of 1353?

1, 3, 11, 33, 41, 123, 451, 1353

There is a total of 8 positive divisors.
The sum of these divisors is 2016.
The arithmetic mean is 252.

8 odd divisors

1, 3, 11, 33, 41, 123, 451, 1353

How to compute the divisors of 1353?

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

1353 / 1 = 1353 (the remainder is 0, so 1 is a divisor of 1353)
1353 / 2 = 676.5 (the remainder is 1, so 2 is not a divisor of 1353)
1353 / 3 = 451 (the remainder is 0, so 3 is a divisor of 1353)
...
1353 / 1352 = 1.0007396449704 (the remainder is 1, so 1352 is not a divisor of 1353)
1353 / 1353 = 1 (the remainder is 0, so 1353 is a divisor of 1353)

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 1353 (i.e. 36.783148315499). 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$ )

1353 / 1 = 1353 (the remainder is 0, so 1 and 1353 are divisors of 1353)
1353 / 2 = 676.5 (the remainder is 1, so 2 is not a divisor of 1353)
1353 / 3 = 451 (the remainder is 0, so 3 and 451 are divisors of 1353)
...
1353 / 35 = 38.657142857143 (the remainder is 23, so 35 is not a divisor of 1353)
1353 / 36 = 37.583333333333 (the remainder is 21, so 36 is not a divisor of 1353)