What is the Greatest Common Factor of 65480 and 65489?

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

GCF(65480,65489) = 1

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

How to find the GCF of 65480 and 65489?

We will first find the prime factorization of 65480 and 65489. After we will calculate the factors of 65480 and 65489 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 65489

Prime factors of 65489 are 43, 1523. Prime factorization of 65489 in exponential form is:

65489 = 43¹ × 1523¹

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 65489

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

1, 43, 1523

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65480 and 65489