What are the divisors of 1352?

1, 2, 4, 8, 13, 26, 52, 104, 169, 338, 676, 1352

There is a total of 12 positive divisors.
The sum of these divisors is 2745.
The arithmetic mean is 228.75.

9 even divisors

2, 4, 8, 26, 52, 104, 338, 676, 1352

3 odd divisors

1, 13, 169

How to compute the divisors of 1352?

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

1352 / 1 = 1352 (the remainder is 0, so 1 is a divisor of 1352)
1352 / 2 = 676 (the remainder is 0, so 2 is a divisor of 1352)
1352 / 3 = 450.66666666667 (the remainder is 2, so 3 is not a divisor of 1352)
...
1352 / 1351 = 1.00074019245 (the remainder is 1, so 1351 is not a divisor of 1352)
1352 / 1352 = 1 (the remainder is 0, so 1352 is a divisor of 1352)

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 1352 (i.e. 36.7695526217). 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$ )

1352 / 1 = 1352 (the remainder is 0, so 1 and 1352 are divisors of 1352)
1352 / 2 = 676 (the remainder is 0, so 2 and 676 are divisors of 1352)
1352 / 3 = 450.66666666667 (the remainder is 2, so 3 is not a divisor of 1352)
...
1352 / 35 = 38.628571428571 (the remainder is 22, so 35 is not a divisor of 1352)
1352 / 36 = 37.555555555556 (the remainder is 20, so 36 is not a divisor of 1352)