What is the Greatest Common Factor of 65273 and 65280?

Greatest common factor (GCF) of 65273 and 65280 is 1.

GCF(65273,65280) = 1

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

How to find the GCF of 65273 and 65280?

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

Step-1: Prime Factorization of 65273

Prime factors of 65273 are 13, 5021. Prime factorization of 65273 in exponential form is:

65273 = 13¹ × 5021¹

Step-2: Prime Factorization of 65280

Prime factors of 65280 are 2, 3, 5, 17. Prime factorization of 65280 in exponential form is:

65280 = 2⁸ × 3¹ × 5¹ × 17¹

Step-3: Factors of 65273

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

1, 13, 5021

Step-4: Factors of 65280

List of positive integer factors of 65280 that divides 65273 without a remainder.

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, 204, 240, 255, 256, 272, 320, 340, 384, 408, 480, 510, 544, 640, 680, 768, 816, 960, 1020, 1088, 1280, 1360, 1632, 1920, 2040, 2176, 2720, 3264, 3840, 4080, 4352, 5440, 6528, 8160, 10880, 13056, 16320, 21760, 32640

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65273 and 65280