What is the Greatest Common Factor of 63962 and 63981?

Greatest common factor (GCF) of 63962 and 63981 is 1.

GCF(63962,63981) = 1

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

How to find the GCF of 63962 and 63981?

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

Step-1: Prime Factorization of 63962

Prime factors of 63962 are 2, 31981. Prime factorization of 63962 in exponential form is:

63962 = 2¹ × 31981¹

Step-2: Prime Factorization of 63981

Prime factors of 63981 are 3, 7109. Prime factorization of 63981 in exponential form is:

63981 = 3² × 7109¹

Step-3: Factors of 63962

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

1, 2, 31981

Step-4: Factors of 63981

List of positive integer factors of 63981 that divides 63962 without a remainder.

1, 3, 9, 7109, 21327

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 63962 and 63981