What is the Greatest Common Factor of 10939 and 10948?

Greatest common factor (GCF) of 10939 and 10948 is 1.

GCF(10939,10948) = 1

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

How to find the GCF of 10939 and 10948?

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

Step-1: Prime Factorization of 10939

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

10939 = 10939¹

Step-2: Prime Factorization of 10948

Prime factors of 10948 are 2, 7, 17, 23. Prime factorization of 10948 in exponential form is:

10948 = 2² × 7¹ × 17¹ × 23¹

Step-3: Factors of 10939

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

Step-4: Factors of 10948

List of positive integer factors of 10948 that divides 10939 without a remainder.

1, 2, 4, 7, 14, 17, 23, 28, 34, 46, 68, 92, 119, 161, 238, 322, 391, 476, 644, 782, 1564, 2737, 5474

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 10939 and 10948