What is the Greatest Common Factor of 48964 and 48981?

Greatest common factor (GCF) of 48964 and 48981 is 1.

GCF(48964,48981) = 1

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

How to find the GCF of 48964 and 48981?

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

Step-1: Prime Factorization of 48964

Prime factors of 48964 are 2, 12241. Prime factorization of 48964 in exponential form is:

48964 = 2² × 12241¹

Step-2: Prime Factorization of 48981

Prime factors of 48981 are 3, 29, 563. Prime factorization of 48981 in exponential form is:

48981 = 3¹ × 29¹ × 563¹

Step-3: Factors of 48964

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

1, 2, 4, 12241, 24482

Step-4: Factors of 48981

List of positive integer factors of 48981 that divides 48964 without a remainder.

1, 3, 29, 87, 563, 1689, 16327

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48964 and 48981