What is the Greatest Common Factor of 65476 and 65482?

Greatest common factor (GCF) of 65476 and 65482 is 2.

GCF(65476,65482) = 2

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

How to find the GCF of 65476 and 65482?

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

Step-1: Prime Factorization of 65476

Prime factors of 65476 are 2, 16369. Prime factorization of 65476 in exponential form is:

65476 = 2² × 16369¹

Step-2: Prime Factorization of 65482

Prime factors of 65482 are 2, 29, 1129. Prime factorization of 65482 in exponential form is:

65482 = 2¹ × 29¹ × 1129¹

Step-3: Factors of 65476

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

1, 2, 4, 16369, 32738

Step-4: Factors of 65482

List of positive integer factors of 65482 that divides 65476 without a remainder.

1, 2, 29, 58, 1129, 2258, 32741

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65476 and 65482