What are the divisors of 9133?

1, 9133

2 odd divisors

1, 9133

How to compute the divisors of 9133?

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

  • 9133 / 1 = 9133 (the remainder is 0, so 1 is a divisor of 9133)
  • 9133 / 2 = 4566.5 (the remainder is 1, so 2 is not a divisor of 9133)
  • 9133 / 3 = 3044.3333333333 (the remainder is 1, so 3 is not a divisor of 9133)
  • ...
  • 9133 / 9132 = 1.0001095050372 (the remainder is 1, so 9132 is not a divisor of 9133)
  • 9133 / 9133 = 1 (the remainder is 0, so 9133 is a divisor of 9133)

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 9133 (i.e. 95.566730612698). 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 )

  • 9133 / 1 = 9133 (the remainder is 0, so 1 and 9133 are divisors of 9133)
  • 9133 / 2 = 4566.5 (the remainder is 1, so 2 is not a divisor of 9133)
  • 9133 / 3 = 3044.3333333333 (the remainder is 1, so 3 is not a divisor of 9133)
  • ...
  • 9133 / 94 = 97.159574468085 (the remainder is 15, so 94 is not a divisor of 9133)
  • 9133 / 95 = 96.136842105263 (the remainder is 13, so 95 is not a divisor of 9133)