What are the divisors of 4249?

1, 7, 607, 4249

There is a total of 4 positive divisors.
The sum of these divisors is 4864.
The arithmetic mean is 1216.

4 odd divisors

1, 7, 607, 4249

How to compute the divisors of 4249?

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

4249 / 1 = 4249 (the remainder is 0, so 1 is a divisor of 4249)
4249 / 2 = 2124.5 (the remainder is 1, so 2 is not a divisor of 4249)
4249 / 3 = 1416.3333333333 (the remainder is 1, so 3 is not a divisor of 4249)
...
4249 / 4248 = 1.0002354048964 (the remainder is 1, so 4248 is not a divisor of 4249)
4249 / 4249 = 1 (the remainder is 0, so 4249 is a divisor of 4249)

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 4249 (i.e. 65.184353950929). 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$ )

4249 / 1 = 4249 (the remainder is 0, so 1 and 4249 are divisors of 4249)
4249 / 2 = 2124.5 (the remainder is 1, so 2 is not a divisor of 4249)
4249 / 3 = 1416.3333333333 (the remainder is 1, so 3 is not a divisor of 4249)
...
4249 / 64 = 66.390625 (the remainder is 25, so 64 is not a divisor of 4249)
4249 / 65 = 65.369230769231 (the remainder is 24, so 65 is not a divisor of 4249)