What is the Greatest Common Factor of 93947 and 93964?

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

GCF(93947,93964) = 1

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

How to find the GCF of 93947 and 93964?

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

Step-1: Prime Factorization of 93947

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

93947 = 7¹ × 13421¹

Step-2: Prime Factorization of 93964

Prime factors of 93964 are 2, 13, 139. Prime factorization of 93964 in exponential form is:

93964 = 2² × 13² × 139¹

Step-3: Factors of 93947

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

1, 7, 13421

Step-4: Factors of 93964

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

1, 2, 4, 13, 26, 52, 139, 169, 278, 338, 556, 676, 1807, 3614, 7228, 23491, 46982

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 93947 and 93964