What is the Greatest Common Factor of 10052 and 10065?

Greatest common factor (GCF) of 10052 and 10065 is 1.

GCF(10052,10065) = 1

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

How to find the GCF of 10052 and 10065?

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

Step-1: Prime Factorization of 10052

Prime factors of 10052 are 2, 7, 359. Prime factorization of 10052 in exponential form is:

10052 = 2² × 7¹ × 359¹

Step-2: Prime Factorization of 10065

Prime factors of 10065 are 3, 5, 11, 61. Prime factorization of 10065 in exponential form is:

10065 = 3¹ × 5¹ × 11¹ × 61¹

Step-3: Factors of 10052

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

1, 2, 4, 7, 14, 28, 359, 718, 1436, 2513, 5026

Step-4: Factors of 10065

List of positive integer factors of 10065 that divides 10052 without a remainder.

1, 3, 5, 11, 15, 33, 55, 61, 165, 183, 305, 671, 915, 2013, 3355

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10052 and 10065