What is the Greatest Common Factor of 65561 and 65565?

Greatest common factor (GCF) of 65561 and 65565 is 1.

GCF(65561,65565) = 1

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

How to find the GCF of 65561 and 65565?

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

Step-1: Prime Factorization of 65561

Prime factors of 65561 are 53, 1237. Prime factorization of 65561 in exponential form is:

65561 = 53¹ × 1237¹

Step-2: Prime Factorization of 65565

Prime factors of 65565 are 3, 5, 31, 47. Prime factorization of 65565 in exponential form is:

65565 = 3² × 5¹ × 31¹ × 47¹

Step-3: Factors of 65561

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

1, 53, 1237

Step-4: Factors of 65565

List of positive integer factors of 65565 that divides 65561 without a remainder.

1, 3, 5, 9, 15, 31, 45, 47, 93, 141, 155, 235, 279, 423, 465, 705, 1395, 1457, 2115, 4371, 7285, 13113, 21855

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65561 and 65565