What is the Greatest Common Factor of 89258 and 89270?

Greatest common factor (GCF) of 89258 and 89270 is 2.

GCF(89258,89270) = 2

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

How to find the GCF of 89258 and 89270?

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

Step-1: Prime Factorization of 89258

Prime factors of 89258 are 2, 13, 3433. Prime factorization of 89258 in exponential form is:

89258 = 2¹ × 13¹ × 3433¹

Step-2: Prime Factorization of 89270

Prime factors of 89270 are 2, 5, 79, 113. Prime factorization of 89270 in exponential form is:

89270 = 2¹ × 5¹ × 79¹ × 113¹

Step-3: Factors of 89258

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

1, 2, 13, 26, 3433, 6866, 44629

Step-4: Factors of 89270

List of positive integer factors of 89270 that divides 89258 without a remainder.

1, 2, 5, 10, 79, 113, 158, 226, 395, 565, 790, 1130, 8927, 17854, 44635

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 89258 and 89270. The biggest common factor number is the GCF number.
So the greatest common factor 89258 and 89270 is 2.

Also check out the Least Common Multiple of 89258 and 89270