What are the divisors of 3242?

1, 2, 1621, 3242

There is a total of 4 positive divisors.
The sum of these divisors is 4866.
The arithmetic mean is 1216.5.

2 even divisors

2, 3242

2 odd divisors

1, 1621

How to compute the divisors of 3242?

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

3242 / 1 = 3242 (the remainder is 0, so 1 is a divisor of 3242)
3242 / 2 = 1621 (the remainder is 0, so 2 is a divisor of 3242)
3242 / 3 = 1080.6666666667 (the remainder is 2, so 3 is not a divisor of 3242)
...
3242 / 3241 = 1.0003085467448 (the remainder is 1, so 3241 is not a divisor of 3242)
3242 / 3242 = 1 (the remainder is 0, so 3242 is a divisor of 3242)

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 3242 (i.e. 56.938563381947). 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$ )

3242 / 1 = 3242 (the remainder is 0, so 1 and 3242 are divisors of 3242)
3242 / 2 = 1621 (the remainder is 0, so 2 and 1621 are divisors of 3242)
3242 / 3 = 1080.6666666667 (the remainder is 2, so 3 is not a divisor of 3242)
...
3242 / 55 = 58.945454545455 (the remainder is 52, so 55 is not a divisor of 3242)
3242 / 56 = 57.892857142857 (the remainder is 50, so 56 is not a divisor of 3242)