What is the Greatest Common Factor of 80470 and 80483?

Greatest common factor (GCF) of 80470 and 80483 is 13.

GCF(80470,80483) = 13

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

How to find the GCF of 80470 and 80483?

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

Step-1: Prime Factorization of 80470

Prime factors of 80470 are 2, 5, 13, 619. Prime factorization of 80470 in exponential form is:

80470 = 2¹ × 5¹ × 13¹ × 619¹

Step-2: 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-3: Factors of 80470

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

1, 2, 5, 10, 13, 26, 65, 130, 619, 1238, 3095, 6190, 8047, 16094, 40235

Step-4: Factors of 80483

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 80470 and 80483