What is the Greatest Common Factor of 80643 and 80648?

Greatest common factor (GCF) of 80643 and 80648 is 1.

GCF(80643,80648) = 1

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

How to find the GCF of 80643 and 80648?

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

Step-1: Prime Factorization of 80643

Prime factors of 80643 are 3, 26881. Prime factorization of 80643 in exponential form is:

80643 = 3¹ × 26881¹

Step-2: Prime Factorization of 80648

Prime factors of 80648 are 2, 17, 593. Prime factorization of 80648 in exponential form is:

80648 = 2³ × 17¹ × 593¹

Step-3: Factors of 80643

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

1, 3, 26881

Step-4: Factors of 80648

List of positive integer factors of 80648 that divides 80643 without a remainder.

1, 2, 4, 8, 17, 34, 68, 136, 593, 1186, 2372, 4744, 10081, 20162, 40324

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80643 and 80648