What is the Greatest Common Factor of 39663 and 39680?

Greatest common factor (GCF) of 39663 and 39680 is 1.

GCF(39663,39680) = 1

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

How to find the GCF of 39663 and 39680?

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

Step-1: Prime Factorization of 39663

Prime factors of 39663 are 3, 13, 113. Prime factorization of 39663 in exponential form is:

39663 = 3³ × 13¹ × 113¹

Step-2: Prime Factorization of 39680

Prime factors of 39680 are 2, 5, 31. Prime factorization of 39680 in exponential form is:

39680 = 2⁸ × 5¹ × 31¹

Step-3: Factors of 39663

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

1, 3, 9, 13, 27, 39, 113, 117, 339, 351, 1017, 1469, 3051, 4407, 13221

Step-4: Factors of 39680

List of positive integer factors of 39680 that divides 39663 without a remainder.

1, 2, 4, 5, 8, 10, 16, 20, 31, 32, 40, 62, 64, 80, 124, 128, 155, 160, 248, 256, 310, 320, 496, 620, 640, 992, 1240, 1280, 1984, 2480, 3968, 4960, 7936, 9920, 19840

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 39663 and 39680