What is the Greatest Common Factor of 96802 and 96809?

Greatest common factor (GCF) of 96802 and 96809 is 1.

GCF(96802,96809) = 1

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

How to find the GCF of 96802 and 96809?

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

Step-1: Prime Factorization of 96802

Prime factors of 96802 are 2, 29, 1669. Prime factorization of 96802 in exponential form is:

96802 = 2¹ × 29¹ × 1669¹

Step-2: Prime Factorization of 96809

Prime factors of 96809 are 131, 739. Prime factorization of 96809 in exponential form is:

96809 = 131¹ × 739¹

Step-3: Factors of 96802

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

1, 2, 29, 58, 1669, 3338, 48401

Step-4: Factors of 96809

List of positive integer factors of 96809 that divides 96802 without a remainder.

1, 131, 739

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 96802 and 96809