What is the Greatest Common Factor of 84047 and 84064?

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

GCF(84047,84064) = 1

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

How to find the GCF of 84047 and 84064?

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

Step-1: Prime Factorization of 84047

Prime factors of 84047 are 84047. Prime factorization of 84047 in exponential form is:

84047 = 84047¹

Step-2: 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-3: Factors of 84047

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

Step-4: Factors of 84064

List of positive integer factors of 84064 that divides 84047 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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84047 and 84064