What is the Greatest Common Factor of 84064 and 84073?

Greatest common factor (GCF) of 84064 and 84073 is 1.

GCF(84064,84073) = 1

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

How to find the GCF of 84064 and 84073?

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

Step-1: Prime Factorization of 84064

Prime factors of 84064 are 2, 37, 71. Prime factorization of 84064 in exponential form is:

84064 = 2⁵ × 37¹ × 71¹

Step-2: Prime Factorization of 84073

Prime factors of 84073 are 11, 7643. Prime factorization of 84073 in exponential form is:

84073 = 11¹ × 7643¹

Step-3: Factors of 84064

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

1, 2, 4, 8, 16, 32, 37, 71, 74, 142, 148, 284, 296, 568, 592, 1136, 1184, 2272, 2627, 5254, 10508, 21016, 42032

Step-4: Factors of 84073

List of positive integer factors of 84073 that divides 84064 without a remainder.

1, 11, 7643

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84064 and 84073