What is the Greatest Common Factor of 1548 and 1561?

Greatest common factor (GCF) of 1548 and 1561 is 1.

GCF(1548,1561) = 1

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

How to find the GCF of 1548 and 1561?

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

Step-1: Prime Factorization of 1548

Prime factors of 1548 are 2, 3, 43. Prime factorization of 1548 in exponential form is:

1548 = 2² × 3² × 43¹

Step-2: Prime Factorization of 1561

Prime factors of 1561 are 7, 223. Prime factorization of 1561 in exponential form is:

1561 = 7¹ × 223¹

Step-3: Factors of 1548

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

1, 2, 3, 4, 6, 9, 12, 18, 36, 43, 86, 129, 172, 258, 387, 516, 774

Step-4: Factors of 1561

List of positive integer factors of 1561 that divides 1548 without a remainder.

1, 7, 223

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1548 and 1561