What is the Greatest Common Factor of 84062 and 84066?

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

GCF(84062,84066) = 2

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

How to find the GCF of 84062 and 84066?

We will first find the prime factorization of 84062 and 84066. After we will calculate the factors of 84062 and 84066 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 84066

Prime factors of 84066 are 2, 3, 14011. Prime factorization of 84066 in exponential form is:

84066 = 2¹ × 3¹ × 14011¹

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 84066

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

1, 2, 3, 6, 14011, 28022, 42033

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84062 and 84066