What is the Greatest Common Factor of 12948 and 12952?

Greatest common factor (GCF) of 12948 and 12952 is 4.

GCF(12948,12952) = 4

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

How to find the GCF of 12948 and 12952?

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

Step-1: Prime Factorization of 12948

Prime factors of 12948 are 2, 3, 13, 83. Prime factorization of 12948 in exponential form is:

12948 = 2² × 3¹ × 13¹ × 83¹

Step-2: Prime Factorization of 12952

Prime factors of 12952 are 2, 1619. Prime factorization of 12952 in exponential form is:

12952 = 2³ × 1619¹

Step-3: Factors of 12948

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

1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 83, 156, 166, 249, 332, 498, 996, 1079, 2158, 3237, 4316, 6474

Step-4: Factors of 12952

List of positive integer factors of 12952 that divides 12948 without a remainder.

1, 2, 4, 8, 1619, 3238, 6476

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 12948 and 12952. The biggest common factor number is the GCF number.
So the greatest common factor 12948 and 12952 is 4.

Also check out the Least Common Multiple of 12948 and 12952