What are the divisors of 6062?

1, 2, 7, 14, 433, 866, 3031, 6062

There is a total of 8 positive divisors.
The sum of these divisors is 10416.
The arithmetic mean is 1302.

4 even divisors

2, 14, 866, 6062

4 odd divisors

1, 7, 433, 3031

How to compute the divisors of 6062?

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

6062 / 1 = 6062 (the remainder is 0, so 1 is a divisor of 6062)
6062 / 2 = 3031 (the remainder is 0, so 2 is a divisor of 6062)
6062 / 3 = 2020.6666666667 (the remainder is 2, so 3 is not a divisor of 6062)
...
6062 / 6061 = 1.0001649892757 (the remainder is 1, so 6061 is not a divisor of 6062)
6062 / 6062 = 1 (the remainder is 0, so 6062 is a divisor of 6062)

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 6062 (i.e. 77.858846639287). 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$ )

6062 / 1 = 6062 (the remainder is 0, so 1 and 6062 are divisors of 6062)
6062 / 2 = 3031 (the remainder is 0, so 2 and 3031 are divisors of 6062)
6062 / 3 = 2020.6666666667 (the remainder is 2, so 3 is not a divisor of 6062)
...
6062 / 76 = 79.763157894737 (the remainder is 58, so 76 is not a divisor of 6062)
6062 / 77 = 78.727272727273 (the remainder is 56, so 77 is not a divisor of 6062)