What is the Greatest Common Factor of 84062 and 84068?

Greatest common factor (GCF) of 84062 and 84068 is 2.

GCF(84062,84068) = 2

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

How to find the GCF of 84062 and 84068?

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

Step-1: Prime Factorization of 84062

Prime factors of 84062 are 2, 11, 3821. Prime factorization of 84062 in exponential form is:

84062 = 2¹ × 11¹ × 3821¹

Step-2: Prime Factorization of 84068

Prime factors of 84068 are 2, 21017. Prime factorization of 84068 in exponential form is:

84068 = 2² × 21017¹

Step-3: Factors of 84062

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

1, 2, 11, 22, 3821, 7642, 42031

Step-4: Factors of 84068

List of positive integer factors of 84068 that divides 84062 without a remainder.

1, 2, 4, 21017, 42034

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84062 and 84068