What is the Greatest Common Factor of 63480 and 63487?

Greatest common factor (GCF) of 63480 and 63487 is 1.

GCF(63480,63487) = 1

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

How to find the GCF of 63480 and 63487?

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

Step-1: Prime Factorization of 63480

Prime factors of 63480 are 2, 3, 5, 23. Prime factorization of 63480 in exponential form is:

63480 = 2³ × 3¹ × 5¹ × 23²

Step-2: Prime Factorization of 63487

Prime factors of 63487 are 63487. Prime factorization of 63487 in exponential form is:

63487 = 63487¹

Step-3: Factors of 63480

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

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 23, 24, 30, 40, 46, 60, 69, 92, 115, 120, 138, 184, 230, 276, 345, 460, 529, 552, 690, 920, 1058, 1380, 1587, 2116, 2645, 2760, 3174, 4232, 5290, 6348, 7935, 10580, 12696, 15870, 21160, 31740

Step-4: Factors of 63487

List of positive integer factors of 63487 that divides 63480 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63480 and 63487