What is the Greatest Common Factor of 15039 and 15048?

Greatest common factor (GCF) of 15039 and 15048 is 9.

GCF(15039,15048) = 9

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

How to find the GCF of 15039 and 15048?

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

Step-1: Prime Factorization of 15039

Prime factors of 15039 are 3, 557. Prime factorization of 15039 in exponential form is:

15039 = 3³ × 557¹

Step-2: Prime Factorization of 15048

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

15048 = 2³ × 3² × 11¹ × 19¹

Step-3: Factors of 15039

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

1, 3, 9, 27, 557, 1671, 5013

Step-4: Factors of 15048

List of positive integer factors of 15048 that divides 15039 without a remainder.

1, 2, 3, 4, 6, 8, 9, 11, 12, 18, 19, 22, 24, 33, 36, 38, 44, 57, 66, 72, 76, 88, 99, 114, 132, 152, 171, 198, 209, 228, 264, 342, 396, 418, 456, 627, 684, 792, 836, 1254, 1368, 1672, 1881, 2508, 3762, 5016, 7524

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15039 and 15048