What is the Greatest Common Factor of 50939 and 50952?

Greatest common factor (GCF) of 50939 and 50952 is 1.

GCF(50939,50952) = 1

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

How to find the GCF of 50939 and 50952?

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

Step-1: Prime Factorization of 50939

Prime factors of 50939 are 7, 19, 383. Prime factorization of 50939 in exponential form is:

50939 = 7¹ × 19¹ × 383¹

Step-2: Prime Factorization of 50952

Prime factors of 50952 are 2, 3, 11, 193. Prime factorization of 50952 in exponential form is:

50952 = 2³ × 3¹ × 11¹ × 193¹

Step-3: Factors of 50939

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

1, 7, 19, 133, 383, 2681, 7277

Step-4: Factors of 50952

List of positive integer factors of 50952 that divides 50939 without a remainder.

1, 2, 3, 4, 6, 8, 11, 12, 22, 24, 33, 44, 66, 88, 132, 193, 264, 386, 579, 772, 1158, 1544, 2123, 2316, 4246, 4632, 6369, 8492, 12738, 16984, 25476

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 50939 and 50952