What is the Greatest Common Factor of 96806 and 96813?

Greatest common factor (GCF) of 96806 and 96813 is 1.

GCF(96806,96813) = 1

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

How to find the GCF of 96806 and 96813?

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

Step-1: Prime Factorization of 96806

Prime factors of 96806 are 2, 97, 499. Prime factorization of 96806 in exponential form is:

96806 = 2¹ × 97¹ × 499¹

Step-2: Prime Factorization of 96813

Prime factors of 96813 are 3, 31, 347. Prime factorization of 96813 in exponential form is:

96813 = 3² × 31¹ × 347¹

Step-3: Factors of 96806

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

1, 2, 97, 194, 499, 998, 48403

Step-4: Factors of 96813

List of positive integer factors of 96813 that divides 96806 without a remainder.

1, 3, 9, 31, 93, 279, 347, 1041, 3123, 10757, 32271

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 96806 and 96813