What is the Greatest Common Factor of 94047 and 94052?

Greatest common factor (GCF) of 94047 and 94052 is 1.

GCF(94047,94052) = 1

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

How to find the GCF of 94047 and 94052?

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

Step-1: Prime Factorization of 94047

Prime factors of 94047 are 3, 23, 29, 47. Prime factorization of 94047 in exponential form is:

94047 = 3¹ × 23¹ × 29¹ × 47¹

Step-2: Prime Factorization of 94052

Prime factors of 94052 are 2, 7, 3359. Prime factorization of 94052 in exponential form is:

94052 = 2² × 7¹ × 3359¹

Step-3: Factors of 94047

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

1, 3, 23, 29, 47, 69, 87, 141, 667, 1081, 1363, 2001, 3243, 4089, 31349

Step-4: Factors of 94052

List of positive integer factors of 94052 that divides 94047 without a remainder.

1, 2, 4, 7, 14, 28, 3359, 6718, 13436, 23513, 47026

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 94047 and 94052