Greatest Common Factor of 128 and 1968
GCF(128, 1968) = 16, Greatest common factor of 128 and 1968 is 16. 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 1968. Greatest Common Factor by prime factorization method and Greatest Common Factor by matching factors method.
Greatest Common Factor of 128 and 1968 by prime factorization method
We will first find the prime factorization of 128 and 1968.
Prime Factorization of 128 is 1, 2, 2, 2, 2, 2, 2, 2 and Prime Factorization of 1968 is 1, 2, 2, 2, 2, 3, 41.
- Factorize\( (128) = \) \(1\times 2\times 2\times 2\times 2\times 2\times 2\times 2\)
- Factorize\( (1968) = \) \(1\times 2\times 2\times 2\times 2\times 3\times 41\)
Now we need to find any which are common for each number (1, 2, 2, 2, 2) and multiply these numbers together.
\(GCF(128, 1968) = 1\times 2\times 2\times 2\times 2 = 16\).
Greatest Common Factor of 128 and 1968 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 1968 leaving a remainder zero is 1, 2, 3, 4, 6, 8, 12, 16, 24, 41, 48, 82, 123, 164, 246, 328, 492, 656, 984, 1968
As you can see, 16 is the greatest and common number that 128 and 1968 divides into.
So the greatest common factor 128 and 1968 is 16.
\(GCF(128, 1968) = 16\).
If you want to learn more about greatest common divisor, take a look at the Wikipedia page.
