What is the Greatest Common Factor of 94730 and 94748?

Greatest common factor (GCF) of 94730 and 94748 is 2.

GCF(94730,94748) = 2

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

How to find the GCF of 94730 and 94748?

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

Step-1: Prime Factorization of 94730

Prime factors of 94730 are 2, 5, 9473. Prime factorization of 94730 in exponential form is:

94730 = 2¹ × 5¹ × 9473¹

Step-2: Prime Factorization of 94748

Prime factors of 94748 are 2, 23687. Prime factorization of 94748 in exponential form is:

94748 = 2² × 23687¹

Step-3: Factors of 94730

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

1, 2, 5, 10, 9473, 18946, 47365

Step-4: Factors of 94748

List of positive integer factors of 94748 that divides 94730 without a remainder.

1, 2, 4, 23687, 47374

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 94730 and 94748. The biggest common factor number is the GCF number.
So the greatest common factor 94730 and 94748 is 2.

Also check out the Least Common Multiple of 94730 and 94748