What is the Greatest Common Factor of 96802 and 96810?

Greatest common factor (GCF) of 96802 and 96810 is 2.

GCF(96802,96810) = 2

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

How to find the GCF of 96802 and 96810?

We will first find the prime factorization of 96802 and 96810. After we will calculate the factors of 96802 and 96810 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 96810

Prime factors of 96810 are 2, 3, 5, 7, 461. Prime factorization of 96810 in exponential form is:

96810 = 2¹ × 3¹ × 5¹ × 7¹ × 461¹

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 96810

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

1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 461, 922, 1383, 2305, 2766, 3227, 4610, 6454, 6915, 9681, 13830, 16135, 19362, 32270, 48405

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 96802 and 96810