What is the Greatest Common Factor of 93938 and 93947?

Greatest common factor (GCF) of 93938 and 93947 is 1.

GCF(93938,93947) = 1

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

How to find the GCF of 93938 and 93947?

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

Step-1: Prime Factorization of 93938

Prime factors of 93938 are 2, 13, 3613. Prime factorization of 93938 in exponential form is:

93938 = 2¹ × 13¹ × 3613¹

Step-2: Prime Factorization of 93947

Prime factors of 93947 are 7, 13421. Prime factorization of 93947 in exponential form is:

93947 = 7¹ × 13421¹

Step-3: Factors of 93938

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

1, 2, 13, 26, 3613, 7226, 46969

Step-4: Factors of 93947

List of positive integer factors of 93947 that divides 93938 without a remainder.

1, 7, 13421

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 93938 and 93947