What is the Greatest Common Factor of 10961 and 10978?

Greatest common factor (GCF) of 10961 and 10978 is 1.

GCF(10961,10978) = 1

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

How to find the GCF of 10961 and 10978?

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

Step-1: Prime Factorization of 10961

Prime factors of 10961 are 97, 113. Prime factorization of 10961 in exponential form is:

10961 = 97¹ × 113¹

Step-2: Prime Factorization of 10978

Prime factors of 10978 are 2, 11, 499. Prime factorization of 10978 in exponential form is:

10978 = 2¹ × 11¹ × 499¹

Step-3: Factors of 10961

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

1, 97, 113

Step-4: Factors of 10978

List of positive integer factors of 10978 that divides 10961 without a remainder.

1, 2, 11, 22, 499, 998, 5489

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10961 and 10978