What is the Greatest Common Factor of 30948 and 30961?

Greatest common factor (GCF) of 30948 and 30961 is 1.

GCF(30948,30961) = 1

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

How to find the GCF of 30948 and 30961?

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

Step-1: Prime Factorization of 30948

Prime factors of 30948 are 2, 3, 2579. Prime factorization of 30948 in exponential form is:

30948 = 2² × 3¹ × 2579¹

Step-2: Prime Factorization of 30961

Prime factors of 30961 are 7, 4423. Prime factorization of 30961 in exponential form is:

30961 = 7¹ × 4423¹

Step-3: Factors of 30948

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

1, 2, 3, 4, 6, 12, 2579, 5158, 7737, 10316, 15474

Step-4: Factors of 30961

List of positive integer factors of 30961 that divides 30948 without a remainder.

1, 7, 4423

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 30948 and 30961