What are the divisors of 1793?

1, 11, 163, 1793

There is a total of 4 positive divisors.
The sum of these divisors is 1968.
The arithmetic mean is 492.

4 odd divisors

1, 11, 163, 1793

How to compute the divisors of 1793?

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

1793 / 1 = 1793 (the remainder is 0, so 1 is a divisor of 1793)
1793 / 2 = 896.5 (the remainder is 1, so 2 is not a divisor of 1793)
1793 / 3 = 597.66666666667 (the remainder is 2, so 3 is not a divisor of 1793)
...
1793 / 1792 = 1.0005580357143 (the remainder is 1, so 1792 is not a divisor of 1793)
1793 / 1793 = 1 (the remainder is 0, so 1793 is a divisor of 1793)

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 1793 (i.e. 42.34383071948). 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$ )

1793 / 1 = 1793 (the remainder is 0, so 1 and 1793 are divisors of 1793)
1793 / 2 = 896.5 (the remainder is 1, so 2 is not a divisor of 1793)
1793 / 3 = 597.66666666667 (the remainder is 2, so 3 is not a divisor of 1793)
...
1793 / 41 = 43.731707317073 (the remainder is 30, so 41 is not a divisor of 1793)
1793 / 42 = 42.690476190476 (the remainder is 29, so 42 is not a divisor of 1793)