What is the Greatest Common Factor of 1540 and 1548?

Greatest common factor (GCF) of 1540 and 1548 is 4.

GCF(1540,1548) = 4

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

How to find the GCF of 1540 and 1548?

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

Step-1: Prime Factorization of 1540

Prime factors of 1540 are 2, 5, 7, 11. Prime factorization of 1540 in exponential form is:

1540 = 2² × 5¹ × 7¹ × 11¹

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

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

1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 140, 154, 220, 308, 385, 770

Step-4: Factors of 1548

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1540 and 1548