What is the Greatest Common Factor of 15564 and 15569?

Greatest common factor (GCF) of 15564 and 15569 is 1.

GCF(15564,15569) = 1

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

How to find the GCF of 15564 and 15569?

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

Step-1: Prime Factorization of 15564

Prime factors of 15564 are 2, 3, 1297. Prime factorization of 15564 in exponential form is:

15564 = 2² × 3¹ × 1297¹

Step-2: Prime Factorization of 15569

Prime factors of 15569 are 15569. Prime factorization of 15569 in exponential form is:

15569 = 15569¹

Step-3: Factors of 15564

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

1, 2, 3, 4, 6, 12, 1297, 2594, 3891, 5188, 7782

Step-4: Factors of 15569

List of positive integer factors of 15569 that divides 15564 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15564 and 15569