What is the Greatest Common Factor of 10952 and 10961?

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

GCF(10952,10961) = 1

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

How to find the GCF of 10952 and 10961?

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

Step-1: Prime Factorization of 10952

Prime factors of 10952 are 2, 37. Prime factorization of 10952 in exponential form is:

10952 = 2³ × 37²

Step-2: Prime Factorization of 10961

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

10961 = 97¹ × 113¹

Step-3: Factors of 10952

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

1, 2, 4, 8, 37, 74, 148, 296, 1369, 2738, 5476

Step-4: Factors of 10961

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

1, 97, 113

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10952 and 10961