What are the divisors of 3605?

1, 5, 7, 35, 103, 515, 721, 3605

8 odd divisors

1, 5, 7, 35, 103, 515, 721, 3605

How to compute the divisors of 3605?

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

  • 3605 / 1 = 3605 (the remainder is 0, so 1 is a divisor of 3605)
  • 3605 / 2 = 1802.5 (the remainder is 1, so 2 is not a divisor of 3605)
  • 3605 / 3 = 1201.6666666667 (the remainder is 2, so 3 is not a divisor of 3605)
  • ...
  • 3605 / 3604 = 1.0002774694784 (the remainder is 1, so 3604 is not a divisor of 3605)
  • 3605 / 3605 = 1 (the remainder is 0, so 3605 is a divisor of 3605)

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 3605 (i.e. 60.041652209112). 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 )

  • 3605 / 1 = 3605 (the remainder is 0, so 1 and 3605 are divisors of 3605)
  • 3605 / 2 = 1802.5 (the remainder is 1, so 2 is not a divisor of 3605)
  • 3605 / 3 = 1201.6666666667 (the remainder is 2, so 3 is not a divisor of 3605)
  • ...
  • 3605 / 59 = 61.101694915254 (the remainder is 6, so 59 is not a divisor of 3605)
  • 3605 / 60 = 60.083333333333 (the remainder is 5, so 60 is not a divisor of 3605)