What are the divisors of 4674?

1, 2, 3, 6, 19, 38, 41, 57, 82, 114, 123, 246, 779, 1558, 2337, 4674

8 even divisors

2, 6, 38, 82, 114, 246, 1558, 4674

8 odd divisors

1, 3, 19, 41, 57, 123, 779, 2337

How to compute the divisors of 4674?

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

  • 4674 / 1 = 4674 (the remainder is 0, so 1 is a divisor of 4674)
  • 4674 / 2 = 2337 (the remainder is 0, so 2 is a divisor of 4674)
  • 4674 / 3 = 1558 (the remainder is 0, so 3 is a divisor of 4674)
  • ...
  • 4674 / 4673 = 1.0002139952921 (the remainder is 1, so 4673 is not a divisor of 4674)
  • 4674 / 4674 = 1 (the remainder is 0, so 4674 is a divisor of 4674)

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 4674 (i.e. 68.366658540549). 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 )

  • 4674 / 1 = 4674 (the remainder is 0, so 1 and 4674 are divisors of 4674)
  • 4674 / 2 = 2337 (the remainder is 0, so 2 and 2337 are divisors of 4674)
  • 4674 / 3 = 1558 (the remainder is 0, so 3 and 1558 are divisors of 4674)
  • ...
  • 4674 / 67 = 69.761194029851 (the remainder is 51, so 67 is not a divisor of 4674)
  • 4674 / 68 = 68.735294117647 (the remainder is 50, so 68 is not a divisor of 4674)