What is the Greatest Common Factor of 80483 and 80487?

Greatest common factor (GCF) of 80483 and 80487 is 1.

GCF(80483,80487) = 1

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

How to find the GCF of 80483 and 80487?

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

Step-1: Prime Factorization of 80483

Prime factors of 80483 are 13, 41, 151. Prime factorization of 80483 in exponential form is:

80483 = 13¹ × 41¹ × 151¹

Step-2: Prime Factorization of 80487

Prime factors of 80487 are 3, 11, 271. Prime factorization of 80487 in exponential form is:

80487 = 3³ × 11¹ × 271¹

Step-3: Factors of 80483

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

1, 13, 41, 151, 533, 1963, 6191

Step-4: Factors of 80487

List of positive integer factors of 80487 that divides 80483 without a remainder.

1, 3, 9, 11, 27, 33, 99, 271, 297, 813, 2439, 2981, 7317, 8943, 26829

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80483 and 80487