What is the Greatest Common Factor of 42951 and 42964?

Greatest common factor (GCF) of 42951 and 42964 is 1.

GCF(42951,42964) = 1

We will now calculate the prime factors of 42951 and 42964, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 42951 and 42964.

How to find the GCF of 42951 and 42964?

We will first find the prime factorization of 42951 and 42964. After we will calculate the factors of 42951 and 42964 and find the biggest common factor number .

Step-1: Prime Factorization of 42951

Prime factors of 42951 are 3, 103, 139. Prime factorization of 42951 in exponential form is:

42951 = 3¹ × 103¹ × 139¹

Step-2: Prime Factorization of 42964

Prime factors of 42964 are 2, 23, 467. Prime factorization of 42964 in exponential form is:

42964 = 2² × 23¹ × 467¹

Step-3: Factors of 42951

List of positive integer factors of 42951 that divides 42951 without a remainder.

1, 3, 103, 139, 309, 417, 14317

Step-4: Factors of 42964

List of positive integer factors of 42964 that divides 42951 without a remainder.

1, 2, 4, 23, 46, 92, 467, 934, 1868, 10741, 21482

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 42951 and 42964. The biggest common factor number is the GCF number.
So the greatest common factor 42951 and 42964 is 1.

Also check out the Least Common Multiple of 42951 and 42964