What is the Greatest Common Factor of 12948 and 12956?

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

GCF(12948,12956) = 4

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

How to find the GCF of 12948 and 12956?

We will first find the prime factorization of 12948 and 12956. After we will calculate the factors of 12948 and 12956 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 12956

Prime factors of 12956 are 2, 41, 79. Prime factorization of 12956 in exponential form is:

12956 = 2² × 41¹ × 79¹

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 12956

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

1, 2, 4, 41, 79, 82, 158, 164, 316, 3239, 6478

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12948 and 12956