What is the Greatest Common Factor of 96803 and 96815?

Greatest common factor (GCF) of 96803 and 96815 is 1.

GCF(96803,96815) = 1

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

How to find the GCF of 96803 and 96815?

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

Step-1: Prime Factorization of 96803

Prime factors of 96803 are 7, 13829. Prime factorization of 96803 in exponential form is:

96803 = 7¹ × 13829¹

Step-2: Prime Factorization of 96815

Prime factors of 96815 are 5, 17, 67. Prime factorization of 96815 in exponential form is:

96815 = 5¹ × 17² × 67¹

Step-3: Factors of 96803

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

1, 7, 13829

Step-4: Factors of 96815

List of positive integer factors of 96815 that divides 96803 without a remainder.

1, 5, 17, 67, 85, 289, 335, 1139, 1445, 5695, 19363

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 96803 and 96815