What is the Greatest Common Factor of 10951 and 10964?

Greatest common factor (GCF) of 10951 and 10964 is 1.

GCF(10951,10964) = 1

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

How to find the GCF of 10951 and 10964?

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

Step-1: Prime Factorization of 10951

Prime factors of 10951 are 47, 233. Prime factorization of 10951 in exponential form is:

10951 = 47¹ × 233¹

Step-2: Prime Factorization of 10964

Prime factors of 10964 are 2, 2741. Prime factorization of 10964 in exponential form is:

10964 = 2² × 2741¹

Step-3: Factors of 10951

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

1, 47, 233

Step-4: Factors of 10964

List of positive integer factors of 10964 that divides 10951 without a remainder.

1, 2, 4, 2741, 5482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10951 and 10964