What is the Greatest Common Factor of 86048 and 86067?

Greatest common factor (GCF) of 86048 and 86067 is 1.

GCF(86048,86067) = 1

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

How to find the GCF of 86048 and 86067?

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

Step-1: Prime Factorization of 86048

Prime factors of 86048 are 2, 2689. Prime factorization of 86048 in exponential form is:

86048 = 2⁵ × 2689¹

Step-2: Prime Factorization of 86067

Prime factors of 86067 are 3, 73, 131. Prime factorization of 86067 in exponential form is:

86067 = 3² × 73¹ × 131¹

Step-3: Factors of 86048

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

1, 2, 4, 8, 16, 32, 2689, 5378, 10756, 21512, 43024

Step-4: Factors of 86067

List of positive integer factors of 86067 that divides 86048 without a remainder.

1, 3, 9, 73, 131, 219, 393, 657, 1179, 9563, 28689

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 86048 and 86067