What is the Greatest Common Factor of 65480 and 65487?

Greatest common factor (GCF) of 65480 and 65487 is 1.

GCF(65480,65487) = 1

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

How to find the GCF of 65480 and 65487?

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

Step-1: Prime Factorization of 65480

Prime factors of 65480 are 2, 5, 1637. Prime factorization of 65480 in exponential form is:

65480 = 2³ × 5¹ × 1637¹

Step-2: Prime Factorization of 65487

Prime factors of 65487 are 3, 83, 263. Prime factorization of 65487 in exponential form is:

65487 = 3¹ × 83¹ × 263¹

Step-3: Factors of 65480

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

1, 2, 4, 5, 8, 10, 20, 40, 1637, 3274, 6548, 8185, 13096, 16370, 32740

Step-4: Factors of 65487

List of positive integer factors of 65487 that divides 65480 without a remainder.

1, 3, 83, 249, 263, 789, 21829

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65480 and 65487