What is the Greatest Common Factor of 80295 and 80308?

Greatest common factor (GCF) of 80295 and 80308 is 1.

GCF(80295,80308) = 1

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

How to find the GCF of 80295 and 80308?

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

Step-1: Prime Factorization of 80295

Prime factors of 80295 are 3, 5, 53, 101. Prime factorization of 80295 in exponential form is:

80295 = 3¹ × 5¹ × 53¹ × 101¹

Step-2: Prime Factorization of 80308

Prime factors of 80308 are 2, 17, 1181. Prime factorization of 80308 in exponential form is:

80308 = 2² × 17¹ × 1181¹

Step-3: Factors of 80295

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

1, 3, 5, 15, 53, 101, 159, 265, 303, 505, 795, 1515, 5353, 16059, 26765

Step-4: Factors of 80308

List of positive integer factors of 80308 that divides 80295 without a remainder.

1, 2, 4, 17, 34, 68, 1181, 2362, 4724, 20077, 40154

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80295 and 80308