What are the divisors of 1199?

1, 11, 109, 1199

There is a total of 4 positive divisors.
The sum of these divisors is 1320.
The arithmetic mean is 330.

4 odd divisors

1, 11, 109, 1199

How to compute the divisors of 1199?

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

1199 / 1 = 1199 (the remainder is 0, so 1 is a divisor of 1199)
1199 / 2 = 599.5 (the remainder is 1, so 2 is not a divisor of 1199)
1199 / 3 = 399.66666666667 (the remainder is 2, so 3 is not a divisor of 1199)
...
1199 / 1198 = 1.0008347245409 (the remainder is 1, so 1198 is not a divisor of 1199)
1199 / 1199 = 1 (the remainder is 0, so 1199 is a divisor of 1199)

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 1199 (i.e. 34.626579386362). 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$ )

1199 / 1 = 1199 (the remainder is 0, so 1 and 1199 are divisors of 1199)
1199 / 2 = 599.5 (the remainder is 1, so 2 is not a divisor of 1199)
1199 / 3 = 399.66666666667 (the remainder is 2, so 3 is not a divisor of 1199)
...
1199 / 33 = 36.333333333333 (the remainder is 11, so 33 is not a divisor of 1199)
1199 / 34 = 35.264705882353 (the remainder is 9, so 34 is not a divisor of 1199)