What is the Greatest Common Factor of 1368 and 1378?

Greatest common factor (GCF) of 1368 and 1378 is 2.

GCF(1368,1378) = 2

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

How to find the GCF of 1368 and 1378?

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

Step-1: 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-2: Prime Factorization of 1378

Prime factors of 1378 are 2, 13, 53. Prime factorization of 1378 in exponential form is:

1378 = 2¹ × 13¹ × 53¹

Step-3: Factors of 1368

List of positive integer factors of 1368 that divides 1368 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

Step-4: Factors of 1378

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

1, 2, 13, 26, 53, 106, 689

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1368 and 1378