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