What is the Greatest Common Factor of 49147 and 49155?

Greatest common factor (GCF) of 49147 and 49155 is 1.

GCF(49147,49155) = 1

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

How to find the GCF of 49147 and 49155?

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

Step-1: Prime Factorization of 49147

Prime factors of 49147 are 7, 17, 59. Prime factorization of 49147 in exponential form is:

49147 = 7² × 17¹ × 59¹

Step-2: Prime Factorization of 49155

Prime factors of 49155 are 3, 5, 29, 113. Prime factorization of 49155 in exponential form is:

49155 = 3¹ × 5¹ × 29¹ × 113¹

Step-3: Factors of 49147

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

1, 7, 17, 49, 59, 119, 413, 833, 1003, 2891, 7021

Step-4: Factors of 49155

List of positive integer factors of 49155 that divides 49147 without a remainder.

1, 3, 5, 15, 29, 87, 113, 145, 339, 435, 565, 1695, 3277, 9831, 16385

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49147 and 49155