What is the Greatest Common Factor of 49028 and 49047?

Greatest common factor (GCF) of 49028 and 49047 is 1.

GCF(49028,49047) = 1

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

How to find the GCF of 49028 and 49047?

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

Step-1: Prime Factorization of 49028

Prime factors of 49028 are 2, 7, 17, 103. Prime factorization of 49028 in exponential form is:

49028 = 2² × 7¹ × 17¹ × 103¹

Step-2: Prime Factorization of 49047

Prime factors of 49047 are 3, 16349. Prime factorization of 49047 in exponential form is:

49047 = 3¹ × 16349¹

Step-3: Factors of 49028

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

1, 2, 4, 7, 14, 17, 28, 34, 68, 103, 119, 206, 238, 412, 476, 721, 1442, 1751, 2884, 3502, 7004, 12257, 24514

Step-4: Factors of 49047

List of positive integer factors of 49047 that divides 49028 without a remainder.

1, 3, 16349

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49028 and 49047