What is the Greatest Common Factor of 1539 and 1552?

Greatest common factor (GCF) of 1539 and 1552 is 1.

GCF(1539,1552) = 1

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

How to find the GCF of 1539 and 1552?

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

Step-1: Prime Factorization of 1539

Prime factors of 1539 are 3, 19. Prime factorization of 1539 in exponential form is:

1539 = 3⁴ × 19¹

Step-2: Prime Factorization of 1552

Prime factors of 1552 are 2, 97. Prime factorization of 1552 in exponential form is:

1552 = 2⁴ × 97¹

Step-3: Factors of 1539

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

1, 3, 9, 19, 27, 57, 81, 171, 513

Step-4: Factors of 1552

List of positive integer factors of 1552 that divides 1539 without a remainder.

1, 2, 4, 8, 16, 97, 194, 388, 776

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1539 and 1552