What is the Greatest Common Factor of 65478 and 65483?

Greatest common factor (GCF) of 65478 and 65483 is 1.

GCF(65478,65483) = 1

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

How to find the GCF of 65478 and 65483?

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

Step-1: Prime Factorization of 65478

Prime factors of 65478 are 2, 3, 7, 1559. Prime factorization of 65478 in exponential form is:

65478 = 2¹ × 3¹ × 7¹ × 1559¹

Step-2: Prime Factorization of 65483

Prime factors of 65483 are 11, 5953. Prime factorization of 65483 in exponential form is:

65483 = 11¹ × 5953¹

Step-3: Factors of 65478

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

1, 2, 3, 6, 7, 14, 21, 42, 1559, 3118, 4677, 9354, 10913, 21826, 32739

Step-4: Factors of 65483

List of positive integer factors of 65483 that divides 65478 without a remainder.

1, 11, 5953

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65478 and 65483