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