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