What is the Greatest Common Factor of 65468 and 65480?

Greatest common factor (GCF) of 65468 and 65480 is 4.

GCF(65468,65480) = 4

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

How to find the GCF of 65468 and 65480?

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

Step-1: Prime Factorization of 65468

Prime factors of 65468 are 2, 13, 1259. Prime factorization of 65468 in exponential form is:

65468 = 2² × 13¹ × 1259¹

Step-2: Prime Factorization of 65480

Prime factors of 65480 are 2, 5, 1637. Prime factorization of 65480 in exponential form is:

65480 = 2³ × 5¹ × 1637¹

Step-3: Factors of 65468

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

1, 2, 4, 13, 26, 52, 1259, 2518, 5036, 16367, 32734

Step-4: Factors of 65480

List of positive integer factors of 65480 that divides 65468 without a remainder.

1, 2, 4, 5, 8, 10, 20, 40, 1637, 3274, 6548, 8185, 13096, 16370, 32740

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65468 and 65480