What are the divisors of 3533?

1, 3533

2 odd divisors

1, 3533

How to compute the divisors of 3533?

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

  • 3533 / 1 = 3533 (the remainder is 0, so 1 is a divisor of 3533)
  • 3533 / 2 = 1766.5 (the remainder is 1, so 2 is not a divisor of 3533)
  • 3533 / 3 = 1177.6666666667 (the remainder is 2, so 3 is not a divisor of 3533)
  • ...
  • 3533 / 3532 = 1.0002831257078 (the remainder is 1, so 3532 is not a divisor of 3533)
  • 3533 / 3533 = 1 (the remainder is 0, so 3533 is a divisor of 3533)

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 3533 (i.e. 59.439044406854). 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 )

  • 3533 / 1 = 3533 (the remainder is 0, so 1 and 3533 are divisors of 3533)
  • 3533 / 2 = 1766.5 (the remainder is 1, so 2 is not a divisor of 3533)
  • 3533 / 3 = 1177.6666666667 (the remainder is 2, so 3 is not a divisor of 3533)
  • ...
  • 3533 / 58 = 60.913793103448 (the remainder is 53, so 58 is not a divisor of 3533)
  • 3533 / 59 = 59.881355932203 (the remainder is 52, so 59 is not a divisor of 3533)