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