What is the Greatest Common Factor of 23930 and 23947?

Greatest common factor (GCF) of 23930 and 23947 is 1.

GCF(23930,23947) = 1

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

How to find the GCF of 23930 and 23947?

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

Step-1: Prime Factorization of 23930

Prime factors of 23930 are 2, 5, 2393. Prime factorization of 23930 in exponential form is:

23930 = 2¹ × 5¹ × 2393¹

Step-2: Prime Factorization of 23947

Prime factors of 23947 are 7, 11, 311. Prime factorization of 23947 in exponential form is:

23947 = 7¹ × 11¹ × 311¹

Step-3: Factors of 23930

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

1, 2, 5, 10, 2393, 4786, 11965

Step-4: Factors of 23947

List of positive integer factors of 23947 that divides 23930 without a remainder.

1, 7, 11, 77, 311, 2177, 3421

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 23930 and 23947