What is the Greatest Common Factor of 84032 and 84047?

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

GCF(84032,84047) = 1

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

How to find the GCF of 84032 and 84047?

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

Step-1: Prime Factorization of 84032

Prime factors of 84032 are 2, 13, 101. Prime factorization of 84032 in exponential form is:

84032 = 2⁶ × 13¹ × 101¹

Step-2: Prime Factorization of 84047

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

84047 = 84047¹

Step-3: Factors of 84032

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

1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 101, 104, 202, 208, 404, 416, 808, 832, 1313, 1616, 2626, 3232, 5252, 6464, 10504, 21008, 42016

Step-4: Factors of 84047

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84032 and 84047