What is the Greatest Common Factor of 20952 and 20963?

Greatest common factor (GCF) of 20952 and 20963 is 1.

GCF(20952,20963) = 1

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

How to find the GCF of 20952 and 20963?

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

Step-1: Prime Factorization of 20952

Prime factors of 20952 are 2, 3, 97. Prime factorization of 20952 in exponential form is:

20952 = 2³ × 3³ × 97¹

Step-2: Prime Factorization of 20963

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

20963 = 20963¹

Step-3: Factors of 20952

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

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 97, 108, 194, 216, 291, 388, 582, 776, 873, 1164, 1746, 2328, 2619, 3492, 5238, 6984, 10476

Step-4: Factors of 20963

List of positive integer factors of 20963 that divides 20952 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 20952 and 20963