What is the Greatest Common Factor of 13068 and 13079?

Greatest common factor (GCF) of 13068 and 13079 is 11.

GCF(13068,13079) = 11

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

How to find the GCF of 13068 and 13079?

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

Step-1: Prime Factorization of 13068

Prime factors of 13068 are 2, 3, 11. Prime factorization of 13068 in exponential form is:

13068 = 2² × 3³ × 11²

Step-2: Prime Factorization of 13079

Prime factors of 13079 are 11, 29, 41. Prime factorization of 13079 in exponential form is:

13079 = 11¹ × 29¹ × 41¹

Step-3: Factors of 13068

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

1, 2, 3, 4, 6, 9, 11, 12, 18, 22, 27, 33, 36, 44, 54, 66, 99, 108, 121, 132, 198, 242, 297, 363, 396, 484, 594, 726, 1089, 1188, 1452, 2178, 3267, 4356, 6534

Step-4: Factors of 13079

List of positive integer factors of 13079 that divides 13068 without a remainder.

1, 11, 29, 41, 319, 451, 1189

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 13068 and 13079. The biggest common factor number is the GCF number.
So the greatest common factor 13068 and 13079 is 11.

Also check out the Least Common Multiple of 13068 and 13079