What is the Greatest Common Factor of 64251 and 64268?

Greatest common factor (GCF) of 64251 and 64268 is 1.

GCF(64251,64268) = 1

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

How to find the GCF of 64251 and 64268?

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

Step-1: Prime Factorization of 64251

Prime factors of 64251 are 3, 11, 59. Prime factorization of 64251 in exponential form is:

64251 = 3² × 11² × 59¹

Step-2: Prime Factorization of 64268

Prime factors of 64268 are 2, 16067. Prime factorization of 64268 in exponential form is:

64268 = 2² × 16067¹

Step-3: Factors of 64251

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

1, 3, 9, 11, 33, 59, 99, 121, 177, 363, 531, 649, 1089, 1947, 5841, 7139, 21417

Step-4: Factors of 64268

List of positive integer factors of 64268 that divides 64251 without a remainder.

1, 2, 4, 16067, 32134

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64251 and 64268