What is the Greatest Common Factor of 84051 and 84068?

Greatest common factor (GCF) of 84051 and 84068 is 1.

GCF(84051,84068) = 1

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

How to find the GCF of 84051 and 84068?

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

Step-1: Prime Factorization of 84051

Prime factors of 84051 are 3, 11, 283. Prime factorization of 84051 in exponential form is:

84051 = 3³ × 11¹ × 283¹

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 84051

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

1, 3, 9, 11, 27, 33, 99, 283, 297, 849, 2547, 3113, 7641, 9339, 28017

Step-4: Factors of 84068

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

1, 2, 4, 21017, 42034

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84051 and 84068