What is the Greatest Common Factor of 64280 and 64299?

Greatest common factor (GCF) of 64280 and 64299 is 1.

GCF(64280,64299) = 1

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

How to find the GCF of 64280 and 64299?

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

Step-1: Prime Factorization of 64280

Prime factors of 64280 are 2, 5, 1607. Prime factorization of 64280 in exponential form is:

64280 = 2³ × 5¹ × 1607¹

Step-2: Prime Factorization of 64299

Prime factors of 64299 are 3, 21433. Prime factorization of 64299 in exponential form is:

64299 = 3¹ × 21433¹

Step-3: Factors of 64280

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

1, 2, 4, 5, 8, 10, 20, 40, 1607, 3214, 6428, 8035, 12856, 16070, 32140

Step-4: Factors of 64299

List of positive integer factors of 64299 that divides 64280 without a remainder.

1, 3, 21433

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64280 and 64299