What is the Greatest Common Factor of 19652 and 19659?

Greatest common factor (GCF) of 19652 and 19659 is 1.

GCF(19652,19659) = 1

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

How to find the GCF of 19652 and 19659?

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

Step-1: Prime Factorization of 19652

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

19652 = 2² × 17³

Step-2: Prime Factorization of 19659

Prime factors of 19659 are 3, 6553. Prime factorization of 19659 in exponential form is:

19659 = 3¹ × 6553¹

Step-3: Factors of 19652

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

1, 2, 4, 17, 34, 68, 289, 578, 1156, 4913, 9826

Step-4: Factors of 19659

List of positive integer factors of 19659 that divides 19652 without a remainder.

1, 3, 6553

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 19652 and 19659