What is the Greatest Common Factor of 48968 and 48975?

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

GCF(48968,48975) = 1

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

How to find the GCF of 48968 and 48975?

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

Step-1: Prime Factorization of 48968

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

48968 = 2³ × 6121¹

Step-2: Prime Factorization of 48975

Prime factors of 48975 are 3, 5, 653. Prime factorization of 48975 in exponential form is:

48975 = 3¹ × 5² × 653¹

Step-3: Factors of 48968

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

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

Step-4: Factors of 48975

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

1, 3, 5, 15, 25, 75, 653, 1959, 3265, 9795, 16325

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48968 and 48975