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