Greatest Common Factor of 936 and 65
GCF(936, 65) = 13, Greatest common factor of 936 and 65 is 13. 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 65. Greatest Common Factor by prime factorization method and Greatest Common Factor by matching factors method.
Greatest Common Factor of 936 and 65 by prime factorization method
We will first find the prime factorization of 936 and 65.
Prime Factorization of 936 is 1, 2, 2, 2, 3, 3, 13 and Prime Factorization of 65 is 1, 5, 13.
- Factorize\( (936) = \) \(1\times 2\times 2\times 2\times 3\times 3\times 13\)
- Factorize\( (65) = \) \(1\times 5\times 13\)
Now we need to find any which are common for each number (1, 13) and multiply these numbers together.
\(GCF(936, 65) = 1\times 13 = 13\).
Greatest Common Factor of 936 and 65 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 65 leaving a remainder zero is 1, 5, 13, 65
As you can see, 13 is the greatest and common number that 936 and 65 divides into.
So the greatest common factor 936 and 65 is 13.
\(GCF(936, 65) = 13\).
If you want to learn more about greatest common divisor, take a look at the Wikipedia page.
