What is the Greatest Common Factor of 38935 and 38948?

Greatest common factor (GCF) of 38935 and 38948 is 13.

GCF(38935,38948) = 13

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

How to find the GCF of 38935 and 38948?

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

Step-1: Prime Factorization of 38935

Prime factors of 38935 are 5, 13, 599. Prime factorization of 38935 in exponential form is:

38935 = 5¹ × 13¹ × 599¹

Step-2: Prime Factorization of 38948

Prime factors of 38948 are 2, 7, 13, 107. Prime factorization of 38948 in exponential form is:

38948 = 2² × 7¹ × 13¹ × 107¹

Step-3: Factors of 38935

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

1, 5, 13, 65, 599, 2995, 7787

Step-4: Factors of 38948

List of positive integer factors of 38948 that divides 38935 without a remainder.

1, 2, 4, 7, 13, 14, 26, 28, 52, 91, 107, 182, 214, 364, 428, 749, 1391, 1498, 2782, 2996, 5564, 9737, 19474

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 38935 and 38948. The biggest common factor number is the GCF number.
So the greatest common factor 38935 and 38948 is 13.

Also check out the Least Common Multiple of 38935 and 38948