What are the divisors of 2792?

1, 2, 4, 8, 349, 698, 1396, 2792

There is a total of 8 positive divisors.
The sum of these divisors is 5250.
The arithmetic mean is 656.25.

6 even divisors

2, 4, 8, 698, 1396, 2792

2 odd divisors

1, 349

How to compute the divisors of 2792?

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

2792 / 1 = 2792 (the remainder is 0, so 1 is a divisor of 2792)
2792 / 2 = 1396 (the remainder is 0, so 2 is a divisor of 2792)
2792 / 3 = 930.66666666667 (the remainder is 2, so 3 is not a divisor of 2792)
...
2792 / 2791 = 1.0003582945181 (the remainder is 1, so 2791 is not a divisor of 2792)
2792 / 2792 = 1 (the remainder is 0, so 2792 is a divisor of 2792)

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 2792 (i.e. 52.839379254492). 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$ )

2792 / 1 = 2792 (the remainder is 0, so 1 and 2792 are divisors of 2792)
2792 / 2 = 1396 (the remainder is 0, so 2 and 1396 are divisors of 2792)
2792 / 3 = 930.66666666667 (the remainder is 2, so 3 is not a divisor of 2792)
...
2792 / 51 = 54.745098039216 (the remainder is 38, so 51 is not a divisor of 2792)
2792 / 52 = 53.692307692308 (the remainder is 36, so 52 is not a divisor of 2792)