What is the Greatest Common Factor of 1564 and 1569?

Greatest common factor (GCF) of 1564 and 1569 is 1.

GCF(1564,1569) = 1

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

How to find the GCF of 1564 and 1569?

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

Step-1: Prime Factorization of 1564

Prime factors of 1564 are 2, 17, 23. Prime factorization of 1564 in exponential form is:

1564 = 2² × 17¹ × 23¹

Step-2: Prime Factorization of 1569

Prime factors of 1569 are 3, 523. Prime factorization of 1569 in exponential form is:

1569 = 3¹ × 523¹

Step-3: Factors of 1564

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

1, 2, 4, 17, 23, 34, 46, 68, 92, 391, 782

Step-4: Factors of 1569

List of positive integer factors of 1569 that divides 1564 without a remainder.

1, 3, 523

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1564 and 1569