What is the Greatest Common Factor of 49062 and 49073?

Greatest common factor (GCF) of 49062 and 49073 is 1.

GCF(49062,49073) = 1

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

How to find the GCF of 49062 and 49073?

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

Step-1: Prime Factorization of 49062

Prime factors of 49062 are 2, 3, 13, 17, 37. Prime factorization of 49062 in exponential form is:

49062 = 2¹ × 3¹ × 13¹ × 17¹ × 37¹

Step-2: Prime Factorization of 49073

Prime factors of 49073 are 31, 1583. Prime factorization of 49073 in exponential form is:

49073 = 31¹ × 1583¹

Step-3: Factors of 49062

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

1, 2, 3, 6, 13, 17, 26, 34, 37, 39, 51, 74, 78, 102, 111, 221, 222, 442, 481, 629, 663, 962, 1258, 1326, 1443, 1887, 2886, 3774, 8177, 16354, 24531

Step-4: Factors of 49073

List of positive integer factors of 49073 that divides 49062 without a remainder.

1, 31, 1583

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49062 and 49073