What is the Greatest Common Factor of 48935 and 48952?

Greatest common factor (GCF) of 48935 and 48952 is 1.

GCF(48935,48952) = 1

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

How to find the GCF of 48935 and 48952?

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

Step-1: Prime Factorization of 48935

Prime factors of 48935 are 5, 9787. Prime factorization of 48935 in exponential form is:

48935 = 5¹ × 9787¹

Step-2: Prime Factorization of 48952

Prime factors of 48952 are 2, 29, 211. Prime factorization of 48952 in exponential form is:

48952 = 2³ × 29¹ × 211¹

Step-3: Factors of 48935

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

1, 5, 9787

Step-4: Factors of 48952

List of positive integer factors of 48952 that divides 48935 without a remainder.

1, 2, 4, 8, 29, 58, 116, 211, 232, 422, 844, 1688, 6119, 12238, 24476

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48935 and 48952