What are the divisors of 3577?

1, 7, 49, 73, 511, 3577

6 odd divisors

1, 7, 49, 73, 511, 3577

How to compute the divisors of 3577?

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

  • 3577 / 1 = 3577 (the remainder is 0, so 1 is a divisor of 3577)
  • 3577 / 2 = 1788.5 (the remainder is 1, so 2 is not a divisor of 3577)
  • 3577 / 3 = 1192.3333333333 (the remainder is 1, so 3 is not a divisor of 3577)
  • ...
  • 3577 / 3576 = 1.0002796420582 (the remainder is 1, so 3576 is not a divisor of 3577)
  • 3577 / 3577 = 1 (the remainder is 0, so 3577 is a divisor of 3577)

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 3577 (i.e. 59.808026217223). 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 )

  • 3577 / 1 = 3577 (the remainder is 0, so 1 and 3577 are divisors of 3577)
  • 3577 / 2 = 1788.5 (the remainder is 1, so 2 is not a divisor of 3577)
  • 3577 / 3 = 1192.3333333333 (the remainder is 1, so 3 is not a divisor of 3577)
  • ...
  • 3577 / 58 = 61.672413793103 (the remainder is 39, so 58 is not a divisor of 3577)
  • 3577 / 59 = 60.627118644068 (the remainder is 37, so 59 is not a divisor of 3577)