What is the Greatest Common Factor of 69147 and 69158?

Greatest common factor (GCF) of 69147 and 69158 is 1.

GCF(69147,69158) = 1

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

How to find the GCF of 69147 and 69158?

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

Step-1: Prime Factorization of 69147

Prime factors of 69147 are 3, 13, 197. Prime factorization of 69147 in exponential form is:

69147 = 3³ × 13¹ × 197¹

Step-2: Prime Factorization of 69158

Prime factors of 69158 are 2, 151, 229. Prime factorization of 69158 in exponential form is:

69158 = 2¹ × 151¹ × 229¹

Step-3: Factors of 69147

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

1, 3, 9, 13, 27, 39, 117, 197, 351, 591, 1773, 2561, 5319, 7683, 23049

Step-4: Factors of 69158

List of positive integer factors of 69158 that divides 69147 without a remainder.

1, 2, 151, 229, 302, 458, 34579

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 69147 and 69158