What are the divisors of 2033?

1, 19, 107, 2033

4 odd divisors

1, 19, 107, 2033

How to compute the divisors of 2033?

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

  • 2033 / 1 = 2033 (the remainder is 0, so 1 is a divisor of 2033)
  • 2033 / 2 = 1016.5 (the remainder is 1, so 2 is not a divisor of 2033)
  • 2033 / 3 = 677.66666666667 (the remainder is 2, so 3 is not a divisor of 2033)
  • ...
  • 2033 / 2032 = 1.0004921259843 (the remainder is 1, so 2032 is not a divisor of 2033)
  • 2033 / 2033 = 1 (the remainder is 0, so 2033 is a divisor of 2033)

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 2033 (i.e. 45.088801270382). 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 )

  • 2033 / 1 = 2033 (the remainder is 0, so 1 and 2033 are divisors of 2033)
  • 2033 / 2 = 1016.5 (the remainder is 1, so 2 is not a divisor of 2033)
  • 2033 / 3 = 677.66666666667 (the remainder is 2, so 3 is not a divisor of 2033)
  • ...
  • 2033 / 44 = 46.204545454545 (the remainder is 9, so 44 is not a divisor of 2033)
  • 2033 / 45 = 45.177777777778 (the remainder is 8, so 45 is not a divisor of 2033)