What is the Greatest Common Factor of 1348 and 1368?

Greatest common factor (GCF) of 1348 and 1368 is 4.

GCF(1348,1368) = 4

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

How to find the GCF of 1348 and 1368?

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

Step-1: Prime Factorization of 1348

Prime factors of 1348 are 2, 337. Prime factorization of 1348 in exponential form is:

1348 = 2² × 337¹

Step-2: Prime Factorization of 1368

Prime factors of 1368 are 2, 3, 19. Prime factorization of 1368 in exponential form is:

1368 = 2³ × 3² × 19¹

Step-3: Factors of 1348

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

1, 2, 4, 337, 674

Step-4: Factors of 1368

List of positive integer factors of 1368 that divides 1348 without a remainder.

1, 2, 3, 4, 6, 8, 9, 12, 18, 19, 24, 36, 38, 57, 72, 76, 114, 152, 171, 228, 342, 456, 684

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1348 and 1368