What is the Greatest Common Factor of 84047 and 84052?

Greatest common factor (GCF) of 84047 and 84052 is 1.

GCF(84047,84052) = 1

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

How to find the GCF of 84047 and 84052?

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

Step-1: Prime Factorization of 84047

Prime factors of 84047 are 84047. Prime factorization of 84047 in exponential form is:

84047 = 84047¹

Step-2: Prime Factorization of 84052

Prime factors of 84052 are 2, 21013. Prime factorization of 84052 in exponential form is:

84052 = 2² × 21013¹

Step-3: Factors of 84047

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

Step-4: Factors of 84052

List of positive integer factors of 84052 that divides 84047 without a remainder.

1, 2, 4, 21013, 42026

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84047 and 84052