What is the Greatest Common Factor of 80258 and 80265?

Greatest common factor (GCF) of 80258 and 80265 is 1.

GCF(80258,80265) = 1

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

How to find the GCF of 80258 and 80265?

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

Step-1: Prime Factorization of 80258

Prime factors of 80258 are 2, 40129. Prime factorization of 80258 in exponential form is:

80258 = 2¹ × 40129¹

Step-2: Prime Factorization of 80265

Prime factors of 80265 are 3, 5, 5351. Prime factorization of 80265 in exponential form is:

80265 = 3¹ × 5¹ × 5351¹

Step-3: Factors of 80258

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

1, 2, 40129

Step-4: Factors of 80265

List of positive integer factors of 80265 that divides 80258 without a remainder.

1, 3, 5, 15, 5351, 16053, 26755

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80258 and 80265