What is the Greatest Common Factor of 65039 and 65052?

Greatest common factor (GCF) of 65039 and 65052 is 13.

GCF(65039,65052) = 13

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

How to find the GCF of 65039 and 65052?

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

Step-1: Prime Factorization of 65039

Prime factors of 65039 are 13, 5003. Prime factorization of 65039 in exponential form is:

65039 = 13¹ × 5003¹

Step-2: Prime Factorization of 65052

Prime factors of 65052 are 2, 3, 13, 139. Prime factorization of 65052 in exponential form is:

65052 = 2² × 3² × 13¹ × 139¹

Step-3: Factors of 65039

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

1, 13, 5003

Step-4: Factors of 65052

List of positive integer factors of 65052 that divides 65039 without a remainder.

1, 2, 3, 4, 6, 9, 12, 13, 18, 26, 36, 39, 52, 78, 117, 139, 156, 234, 278, 417, 468, 556, 834, 1251, 1668, 1807, 2502, 3614, 5004, 5421, 7228, 10842, 16263, 21684, 32526

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 65039 and 65052. The biggest common factor number is the GCF number.
So the greatest common factor 65039 and 65052 is 13.

Also check out the Least Common Multiple of 65039 and 65052