What are the divisors of 3593?

1, 3593

2 odd divisors

1, 3593

How to compute the divisors of 3593?

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

  • 3593 / 1 = 3593 (the remainder is 0, so 1 is a divisor of 3593)
  • 3593 / 2 = 1796.5 (the remainder is 1, so 2 is not a divisor of 3593)
  • 3593 / 3 = 1197.6666666667 (the remainder is 2, so 3 is not a divisor of 3593)
  • ...
  • 3593 / 3592 = 1.0002783964365 (the remainder is 1, so 3592 is not a divisor of 3593)
  • 3593 / 3593 = 1 (the remainder is 0, so 3593 is a divisor of 3593)

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 3593 (i.e. 59.941638282583). 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 )

  • 3593 / 1 = 3593 (the remainder is 0, so 1 and 3593 are divisors of 3593)
  • 3593 / 2 = 1796.5 (the remainder is 1, so 2 is not a divisor of 3593)
  • 3593 / 3 = 1197.6666666667 (the remainder is 2, so 3 is not a divisor of 3593)
  • ...
  • 3593 / 58 = 61.948275862069 (the remainder is 55, so 58 is not a divisor of 3593)
  • 3593 / 59 = 60.898305084746 (the remainder is 53, so 59 is not a divisor of 3593)