What are the divisors of 2298?

1, 2, 3, 6, 383, 766, 1149, 2298

4 even divisors

2, 6, 766, 2298

4 odd divisors

1, 3, 383, 1149

How to compute the divisors of 2298?

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

  • 2298 / 1 = 2298 (the remainder is 0, so 1 is a divisor of 2298)
  • 2298 / 2 = 1149 (the remainder is 0, so 2 is a divisor of 2298)
  • 2298 / 3 = 766 (the remainder is 0, so 3 is a divisor of 2298)
  • ...
  • 2298 / 2297 = 1.0004353504571 (the remainder is 1, so 2297 is not a divisor of 2298)
  • 2298 / 2298 = 1 (the remainder is 0, so 2298 is a divisor of 2298)

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 2298 (i.e. 47.937459256828). 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 )

  • 2298 / 1 = 2298 (the remainder is 0, so 1 and 2298 are divisors of 2298)
  • 2298 / 2 = 1149 (the remainder is 0, so 2 and 1149 are divisors of 2298)
  • 2298 / 3 = 766 (the remainder is 0, so 3 and 766 are divisors of 2298)
  • ...
  • 2298 / 46 = 49.95652173913 (the remainder is 44, so 46 is not a divisor of 2298)
  • 2298 / 47 = 48.893617021277 (the remainder is 42, so 47 is not a divisor of 2298)