What are the divisors of 5233?

1, 5233

2 odd divisors

1, 5233

How to compute the divisors of 5233?

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

  • 5233 / 1 = 5233 (the remainder is 0, so 1 is a divisor of 5233)
  • 5233 / 2 = 2616.5 (the remainder is 1, so 2 is not a divisor of 5233)
  • 5233 / 3 = 1744.3333333333 (the remainder is 1, so 3 is not a divisor of 5233)
  • ...
  • 5233 / 5232 = 1.0001911314985 (the remainder is 1, so 5232 is not a divisor of 5233)
  • 5233 / 5233 = 1 (the remainder is 0, so 5233 is a divisor of 5233)

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 5233 (i.e. 72.339477465627). 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 )

  • 5233 / 1 = 5233 (the remainder is 0, so 1 and 5233 are divisors of 5233)
  • 5233 / 2 = 2616.5 (the remainder is 1, so 2 is not a divisor of 5233)
  • 5233 / 3 = 1744.3333333333 (the remainder is 1, so 3 is not a divisor of 5233)
  • ...
  • 5233 / 71 = 73.704225352113 (the remainder is 50, so 71 is not a divisor of 5233)
  • 5233 / 72 = 72.680555555556 (the remainder is 49, so 72 is not a divisor of 5233)