What is the Greatest Common Factor of 64052 and 64068?

Greatest common factor (GCF) of 64052 and 64068 is 4.

GCF(64052,64068) = 4

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

How to find the GCF of 64052 and 64068?

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

Step-1: Prime Factorization of 64052

Prime factors of 64052 are 2, 67, 239. Prime factorization of 64052 in exponential form is:

64052 = 2² × 67¹ × 239¹

Step-2: Prime Factorization of 64068

Prime factors of 64068 are 2, 3, 19, 281. Prime factorization of 64068 in exponential form is:

64068 = 2² × 3¹ × 19¹ × 281¹

Step-3: Factors of 64052

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

1, 2, 4, 67, 134, 239, 268, 478, 956, 16013, 32026

Step-4: Factors of 64068

List of positive integer factors of 64068 that divides 64052 without a remainder.

1, 2, 3, 4, 6, 12, 19, 38, 57, 76, 114, 228, 281, 562, 843, 1124, 1686, 3372, 5339, 10678, 16017, 21356, 32034

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 64052 and 64068. The biggest common factor number is the GCF number.
So the greatest common factor 64052 and 64068 is 4.

Also check out the Least Common Multiple of 64052 and 64068