What is the Greatest Common Factor of 48957 and 48968?

Greatest common factor (GCF) of 48957 and 48968 is 1.

GCF(48957,48968) = 1

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

How to find the GCF of 48957 and 48968?

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

Step-1: Prime Factorization of 48957

Prime factors of 48957 are 3, 16319. Prime factorization of 48957 in exponential form is:

48957 = 3¹ × 16319¹

Step-2: Prime Factorization of 48968

Prime factors of 48968 are 2, 6121. Prime factorization of 48968 in exponential form is:

48968 = 2³ × 6121¹

Step-3: Factors of 48957

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

1, 3, 16319

Step-4: Factors of 48968

List of positive integer factors of 48968 that divides 48957 without a remainder.

1, 2, 4, 8, 6121, 12242, 24484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48957 and 48968