What are the divisors of 6152?

1, 2, 4, 8, 769, 1538, 3076, 6152

There is a total of 8 positive divisors.
The sum of these divisors is 11550.
The arithmetic mean is 1443.75.

6 even divisors

2, 4, 8, 1538, 3076, 6152

2 odd divisors

1, 769

How to compute the divisors of 6152?

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

6152 / 1 = 6152 (the remainder is 0, so 1 is a divisor of 6152)
6152 / 2 = 3076 (the remainder is 0, so 2 is a divisor of 6152)
6152 / 3 = 2050.6666666667 (the remainder is 2, so 3 is not a divisor of 6152)
...
6152 / 6151 = 1.000162575191 (the remainder is 1, so 6151 is not a divisor of 6152)
6152 / 6152 = 1 (the remainder is 0, so 6152 is a divisor of 6152)

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 6152 (i.e. 78.43468620451). 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$ )

6152 / 1 = 6152 (the remainder is 0, so 1 and 6152 are divisors of 6152)
6152 / 2 = 3076 (the remainder is 0, so 2 and 3076 are divisors of 6152)
6152 / 3 = 2050.6666666667 (the remainder is 2, so 3 is not a divisor of 6152)
...
6152 / 77 = 79.896103896104 (the remainder is 69, so 77 is not a divisor of 6152)
6152 / 78 = 78.871794871795 (the remainder is 68, so 78 is not a divisor of 6152)