What is the Greatest Common Factor of 84078 and 84097?

Greatest common factor (GCF) of 84078 and 84097 is 1.

GCF(84078,84097) = 1

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

How to find the GCF of 84078 and 84097?

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

Step-1: Prime Factorization of 84078

Prime factors of 84078 are 2, 3, 173. Prime factorization of 84078 in exponential form is:

84078 = 2¹ × 3⁵ × 173¹

Step-2: Prime Factorization of 84097

Prime factors of 84097 are 13, 6469. Prime factorization of 84097 in exponential form is:

84097 = 13¹ × 6469¹

Step-3: Factors of 84078

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

1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 173, 243, 346, 486, 519, 1038, 1557, 3114, 4671, 9342, 14013, 28026, 42039

Step-4: Factors of 84097

List of positive integer factors of 84097 that divides 84078 without a remainder.

1, 13, 6469

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84078 and 84097