What is the Greatest Common Factor of 961 and 968?

Greatest common factor (GCF) of 961 and 968 is 1.

GCF(961,968) = 1

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

How to find the GCF of 961 and 968?

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

Step-1: Prime Factorization of 961

Prime factors of 961 are 31. Prime factorization of 961 in exponential form is:

961 = 31²

Step-2: Prime Factorization of 968

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

968 = 2³ × 11²

Step-3: Factors of 961

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

1, 31

Step-4: Factors of 968

List of positive integer factors of 968 that divides 961 without a remainder.

1, 2, 4, 8, 11, 22, 44, 88, 121, 242, 484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 961 and 968