What are the divisors of 5033?

1, 7, 719, 5033

There is a total of 4 positive divisors.
The sum of these divisors is 5760.
The arithmetic mean is 1440.

4 odd divisors

1, 7, 719, 5033

How to compute the divisors of 5033?

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

5033 / 1 = 5033 (the remainder is 0, so 1 is a divisor of 5033)
5033 / 2 = 2516.5 (the remainder is 1, so 2 is not a divisor of 5033)
5033 / 3 = 1677.6666666667 (the remainder is 2, so 3 is not a divisor of 5033)
...
5033 / 5032 = 1.0001987281399 (the remainder is 1, so 5032 is not a divisor of 5033)
5033 / 5033 = 1 (the remainder is 0, so 5033 is a divisor of 5033)

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 5033 (i.e. 70.943639602152). 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$ )

5033 / 1 = 5033 (the remainder is 0, so 1 and 5033 are divisors of 5033)
5033 / 2 = 2516.5 (the remainder is 1, so 2 is not a divisor of 5033)
5033 / 3 = 1677.6666666667 (the remainder is 2, so 3 is not a divisor of 5033)
...
5033 / 69 = 72.942028985507 (the remainder is 65, so 69 is not a divisor of 5033)
5033 / 70 = 71.9 (the remainder is 63, so 70 is not a divisor of 5033)