What are the divisors of 2336?

1, 2, 4, 8, 16, 32, 73, 146, 292, 584, 1168, 2336

10 even divisors

2, 4, 8, 16, 32, 146, 292, 584, 1168, 2336

2 odd divisors

1, 73

How to compute the divisors of 2336?

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 2336 by each of the numbers from 1 to 2336 to determine which ones have a remainder equal to 0.

Remainder = N ( M × N M )

(where N M is the integer part of the quotient)

  • 2336 / 1 = 2336 (the remainder is 0, so 1 is a divisor of 2336)
  • 2336 / 2 = 1168 (the remainder is 0, so 2 is a divisor of 2336)
  • 2336 / 3 = 778.66666666667 (the remainder is 2, so 3 is not a divisor of 2336)
  • ...
  • 2336 / 2335 = 1.0004282655246 (the remainder is 1, so 2335 is not a divisor of 2336)
  • 2336 / 2336 = 1 (the remainder is 0, so 2336 is a divisor of 2336)

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 2336 (i.e. 48.332183894378). 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 × d = N

(thus, if N D = d , then N d = D )

  • 2336 / 1 = 2336 (the remainder is 0, so 1 and 2336 are divisors of 2336)
  • 2336 / 2 = 1168 (the remainder is 0, so 2 and 1168 are divisors of 2336)
  • 2336 / 3 = 778.66666666667 (the remainder is 2, so 3 is not a divisor of 2336)
  • ...
  • 2336 / 47 = 49.702127659574 (the remainder is 33, so 47 is not a divisor of 2336)
  • 2336 / 48 = 48.666666666667 (the remainder is 32, so 48 is not a divisor of 2336)