What is the Greatest Common Factor of 20947 and 20962?

Greatest common factor (GCF) of 20947 and 20962 is 1.

GCF(20947,20962) = 1

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

How to find the GCF of 20947 and 20962?

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

Step-1: Prime Factorization of 20947

Prime factors of 20947 are 20947. Prime factorization of 20947 in exponential form is:

20947 = 20947¹

Step-2: Prime Factorization of 20962

Prime factors of 20962 are 2, 47, 223. Prime factorization of 20962 in exponential form is:

20962 = 2¹ × 47¹ × 223¹

Step-3: Factors of 20947

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

Step-4: Factors of 20962

List of positive integer factors of 20962 that divides 20947 without a remainder.

1, 2, 47, 94, 223, 446, 10481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 20947 and 20962