Greatest Common Factor of 936 and 4670

GCF(936, 4670) = 2, Greatest common factor of 936 and 4670 is 2. Greatest Common Factor or Greatest Common Divisor of two numbers is the largest integer by which both the numbers can be divided. There are two different methods to calculate Greatest Common Factor of 936 and 4670. Greatest Common Factor by prime factorization method and Greatest Common Factor by matching factors method.

Greatest Common Factor of 936 and 4670 by prime factorization method

We will first find the prime factorization of 936 and 4670.
Prime Factorization of 936 is 1, 2, 2, 2, 3, 3, 13 and Prime Factorization of 4670 is 1, 2, 5, 467.

  • Factorize\( (936) = \) \(1\times 2\times 2\times 2\times 3\times 3\times 13\)
  • Factorize\( (4670) = \) \(1\times 2\times 5\times 467\)
Now we need to find any which are common for each number (1, 2) and multiply these numbers together.
\(GCF(936, 4670) = 1\times 2 = 2\).

Greatest Common Factor of 936 and 4670 by matching factors method

List of positive integers factors of 936 leaving a remainder zero is 1, 2, 3, 4, 6, 8, 9, 12, 13, 18, 24, 26, 36, 39, 52, 72, 78, 104, 117, 156, 234, 312, 468, 936
List of positive integers factors of 4670 leaving a remainder zero is 1, 2, 5, 10, 467, 934, 2335, 4670
As you can see, 2 is the greatest and common number that 936 and 4670 divides into.
So the greatest common factor 936 and 4670 is 2.
\(GCF(936, 4670) = 2\).

If you want to learn more about greatest common divisor, take a look at the Wikipedia page.
Greatest common factor of:
 ,