What is the Greatest Common Factor of 86258 and 86267?

Greatest common factor (GCF) of 86258 and 86267 is 1.

GCF(86258,86267) = 1

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

How to find the GCF of 86258 and 86267?

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

Step-1: Prime Factorization of 86258

Prime factors of 86258 are 2, 17, 43, 59. Prime factorization of 86258 in exponential form is:

86258 = 2¹ × 17¹ × 43¹ × 59¹

Step-2: Prime Factorization of 86267

Prime factors of 86267 are 281, 307. Prime factorization of 86267 in exponential form is:

86267 = 281¹ × 307¹

Step-3: Factors of 86258

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

1, 2, 17, 34, 43, 59, 86, 118, 731, 1003, 1462, 2006, 2537, 5074, 43129

Step-4: Factors of 86267

List of positive integer factors of 86267 that divides 86258 without a remainder.

1, 281, 307

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 86258 and 86267