What is the Greatest Common Factor of 96801 and 96816?

Greatest common factor (GCF) of 96801 and 96816 is 3.

GCF(96801,96816) = 3

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

How to find the GCF of 96801 and 96816?

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

Step-1: Prime Factorization of 96801

Prime factors of 96801 are 3, 41, 787. Prime factorization of 96801 in exponential form is:

96801 = 3¹ × 41¹ × 787¹

Step-2: Prime Factorization of 96816

Prime factors of 96816 are 2, 3, 2017. Prime factorization of 96816 in exponential form is:

96816 = 2⁴ × 3¹ × 2017¹

Step-3: Factors of 96801

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

1, 3, 41, 123, 787, 2361, 32267

Step-4: Factors of 96816

List of positive integer factors of 96816 that divides 96801 without a remainder.

1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 2017, 4034, 6051, 8068, 12102, 16136, 24204, 32272, 48408

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 96801 and 96816. The biggest common factor number is the GCF number.
So the greatest common factor 96801 and 96816 is 3.

Also check out the Least Common Multiple of 96801 and 96816