What is the Greatest Common Factor of 1368 and 1373?

Greatest common factor (GCF) of 1368 and 1373 is 1.

GCF(1368,1373) = 1

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

How to find the GCF of 1368 and 1373?

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

Prime factors of 1373 are 1373. Prime factorization of 1373 in exponential form is:

1373 = 1373¹

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 1373

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1368 and 1373