What are the divisors of 9593?

1, 53, 181, 9593

4 odd divisors

1, 53, 181, 9593

How to compute the divisors of 9593?

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

  • 9593 / 1 = 9593 (the remainder is 0, so 1 is a divisor of 9593)
  • 9593 / 2 = 4796.5 (the remainder is 1, so 2 is not a divisor of 9593)
  • 9593 / 3 = 3197.6666666667 (the remainder is 2, so 3 is not a divisor of 9593)
  • ...
  • 9593 / 9592 = 1.0001042535446 (the remainder is 1, so 9592 is not a divisor of 9593)
  • 9593 / 9593 = 1 (the remainder is 0, so 9593 is a divisor of 9593)

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 9593 (i.e. 97.943861471764). 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 )

  • 9593 / 1 = 9593 (the remainder is 0, so 1 and 9593 are divisors of 9593)
  • 9593 / 2 = 4796.5 (the remainder is 1, so 2 is not a divisor of 9593)
  • 9593 / 3 = 3197.6666666667 (the remainder is 2, so 3 is not a divisor of 9593)
  • ...
  • 9593 / 96 = 99.927083333333 (the remainder is 89, so 96 is not a divisor of 9593)
  • 9593 / 97 = 98.896907216495 (the remainder is 87, so 97 is not a divisor of 9593)