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