What are the divisors of 3095?

1, 5, 619, 3095

There is a total of 4 positive divisors.
The sum of these divisors is 3720.
The arithmetic mean is 930.

4 odd divisors

1, 5, 619, 3095

How to compute the divisors of 3095?

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

3095 / 1 = 3095 (the remainder is 0, so 1 is a divisor of 3095)
3095 / 2 = 1547.5 (the remainder is 1, so 2 is not a divisor of 3095)
3095 / 3 = 1031.6666666667 (the remainder is 2, so 3 is not a divisor of 3095)
...
3095 / 3094 = 1.0003232062056 (the remainder is 1, so 3094 is not a divisor of 3095)
3095 / 3095 = 1 (the remainder is 0, so 3095 is a divisor of 3095)

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 3095 (i.e. 55.632724182804). 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$ )

3095 / 1 = 3095 (the remainder is 0, so 1 and 3095 are divisors of 3095)
3095 / 2 = 1547.5 (the remainder is 1, so 2 is not a divisor of 3095)
3095 / 3 = 1031.6666666667 (the remainder is 2, so 3 is not a divisor of 3095)
...
3095 / 54 = 57.314814814815 (the remainder is 17, so 54 is not a divisor of 3095)
3095 / 55 = 56.272727272727 (the remainder is 15, so 55 is not a divisor of 3095)