What are the divisors of 6177?

1, 3, 29, 71, 87, 213, 2059, 6177

8 odd divisors

1, 3, 29, 71, 87, 213, 2059, 6177

How to compute the divisors of 6177?

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

  • 6177 / 1 = 6177 (the remainder is 0, so 1 is a divisor of 6177)
  • 6177 / 2 = 3088.5 (the remainder is 1, so 2 is not a divisor of 6177)
  • 6177 / 3 = 2059 (the remainder is 0, so 3 is a divisor of 6177)
  • ...
  • 6177 / 6176 = 1.0001619170984 (the remainder is 1, so 6176 is not a divisor of 6177)
  • 6177 / 6177 = 1 (the remainder is 0, so 6177 is a divisor of 6177)

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 6177 (i.e. 78.593892892514). 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 )

  • 6177 / 1 = 6177 (the remainder is 0, so 1 and 6177 are divisors of 6177)
  • 6177 / 2 = 3088.5 (the remainder is 1, so 2 is not a divisor of 6177)
  • 6177 / 3 = 2059 (the remainder is 0, so 3 and 2059 are divisors of 6177)
  • ...
  • 6177 / 77 = 80.220779220779 (the remainder is 17, so 77 is not a divisor of 6177)
  • 6177 / 78 = 79.192307692308 (the remainder is 15, so 78 is not a divisor of 6177)