What are the divisors of 5019?

1, 3, 7, 21, 239, 717, 1673, 5019

There is a total of 8 positive divisors.
The sum of these divisors is 7680.
The arithmetic mean is 960.

8 odd divisors

1, 3, 7, 21, 239, 717, 1673, 5019

How to compute the divisors of 5019?

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

5019 / 1 = 5019 (the remainder is 0, so 1 is a divisor of 5019)
5019 / 2 = 2509.5 (the remainder is 1, so 2 is not a divisor of 5019)
5019 / 3 = 1673 (the remainder is 0, so 3 is a divisor of 5019)
...
5019 / 5018 = 1.0001992825827 (the remainder is 1, so 5018 is not a divisor of 5019)
5019 / 5019 = 1 (the remainder is 0, so 5019 is a divisor of 5019)

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 5019 (i.e. 70.844901016234). 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$ )

5019 / 1 = 5019 (the remainder is 0, so 1 and 5019 are divisors of 5019)
5019 / 2 = 2509.5 (the remainder is 1, so 2 is not a divisor of 5019)
5019 / 3 = 1673 (the remainder is 0, so 3 and 1673 are divisors of 5019)
...
5019 / 69 = 72.739130434783 (the remainder is 51, so 69 is not a divisor of 5019)
5019 / 70 = 71.7 (the remainder is 49, so 70 is not a divisor of 5019)