What is the Greatest Common Factor of 93930 and 93947?

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

GCF(93930,93947) = 1

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

How to find the GCF of 93930 and 93947?

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

Step-1: Prime Factorization of 93930

Prime factors of 93930 are 2, 3, 5, 31, 101. Prime factorization of 93930 in exponential form is:

93930 = 2¹ × 3¹ × 5¹ × 31¹ × 101¹

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 93930

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

1, 2, 3, 5, 6, 10, 15, 30, 31, 62, 93, 101, 155, 186, 202, 303, 310, 465, 505, 606, 930, 1010, 1515, 3030, 3131, 6262, 9393, 15655, 18786, 31310, 46965

Step-4: Factors of 93947

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

1, 7, 13421

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 93930 and 93947