What is the Greatest Common Factor of 65050 and 65059?

Greatest common factor (GCF) of 65050 and 65059 is 1.

GCF(65050,65059) = 1

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

How to find the GCF of 65050 and 65059?

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

Step-1: Prime Factorization of 65050

Prime factors of 65050 are 2, 5, 1301. Prime factorization of 65050 in exponential form is:

65050 = 2¹ × 5² × 1301¹

Step-2: Prime Factorization of 65059

Prime factors of 65059 are 17, 43, 89. Prime factorization of 65059 in exponential form is:

65059 = 17¹ × 43¹ × 89¹

Step-3: Factors of 65050

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

1, 2, 5, 10, 25, 50, 1301, 2602, 6505, 13010, 32525

Step-4: Factors of 65059

List of positive integer factors of 65059 that divides 65050 without a remainder.

1, 17, 43, 89, 731, 1513, 3827

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65050 and 65059