What is the Greatest Common Factor of 13059 and 13068?

Greatest common factor (GCF) of 13059 and 13068 is 9.

GCF(13059,13068) = 9

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

How to find the GCF of 13059 and 13068?

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

Step-1: Prime Factorization of 13059

Prime factors of 13059 are 3, 1451. Prime factorization of 13059 in exponential form is:

13059 = 3² × 1451¹

Step-2: 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-3: Factors of 13059

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

1, 3, 9, 1451, 4353

Step-4: Factors of 13068

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13059 and 13068