What is the Greatest Common Factor of 65096 and 65110?

Greatest common factor (GCF) of 65096 and 65110 is 2.

GCF(65096,65110) = 2

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

How to find the GCF of 65096 and 65110?

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

Step-1: Prime Factorization of 65096

Prime factors of 65096 are 2, 79, 103. Prime factorization of 65096 in exponential form is:

65096 = 2³ × 79¹ × 103¹

Step-2: Prime Factorization of 65110

Prime factors of 65110 are 2, 5, 17, 383. Prime factorization of 65110 in exponential form is:

65110 = 2¹ × 5¹ × 17¹ × 383¹

Step-3: Factors of 65096

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

1, 2, 4, 8, 79, 103, 158, 206, 316, 412, 632, 824, 8137, 16274, 32548

Step-4: Factors of 65110

List of positive integer factors of 65110 that divides 65096 without a remainder.

1, 2, 5, 10, 17, 34, 85, 170, 383, 766, 1915, 3830, 6511, 13022, 32555

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 65096 and 65110. The biggest common factor number is the GCF number.
So the greatest common factor 65096 and 65110 is 2.

Also check out the Least Common Multiple of 65096 and 65110