What is the Greatest Common Factor of 4938 and 4952?

Greatest common factor (GCF) of 4938 and 4952 is 2.

GCF(4938,4952) = 2

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

How to find the GCF of 4938 and 4952?

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

Step-1: Prime Factorization of 4938

Prime factors of 4938 are 2, 3, 823. Prime factorization of 4938 in exponential form is:

4938 = 2¹ × 3¹ × 823¹

Step-2: Prime Factorization of 4952

Prime factors of 4952 are 2, 619. Prime factorization of 4952 in exponential form is:

4952 = 2³ × 619¹

Step-3: Factors of 4938

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

1, 2, 3, 6, 823, 1646, 2469

Step-4: Factors of 4952

List of positive integer factors of 4952 that divides 4938 without a remainder.

1, 2, 4, 8, 619, 1238, 2476

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 4938 and 4952. The biggest common factor number is the GCF number.
So the greatest common factor 4938 and 4952 is 2.

Also check out the Least Common Multiple of 4938 and 4952