What are the divisors of 601?

1, 601

2 odd divisors

1, 601

How to compute the divisors of 601?

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

  • 601 / 1 = 601 (the remainder is 0, so 1 is a divisor of 601)
  • 601 / 2 = 300.5 (the remainder is 1, so 2 is not a divisor of 601)
  • 601 / 3 = 200.33333333333 (the remainder is 1, so 3 is not a divisor of 601)
  • ...
  • 601 / 600 = 1.0016666666667 (the remainder is 1, so 600 is not a divisor of 601)
  • 601 / 601 = 1 (the remainder is 0, so 601 is a divisor of 601)

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 601 (i.e. 24.515301344263). 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 )

  • 601 / 1 = 601 (the remainder is 0, so 1 and 601 are divisors of 601)
  • 601 / 2 = 300.5 (the remainder is 1, so 2 is not a divisor of 601)
  • 601 / 3 = 200.33333333333 (the remainder is 1, so 3 is not a divisor of 601)
  • ...
  • 601 / 23 = 26.130434782609 (the remainder is 3, so 23 is not a divisor of 601)
  • 601 / 24 = 25.041666666667 (the remainder is 1, so 24 is not a divisor of 601)