What is the Greatest Common Factor of 48953 and 48964?

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

GCF(48953,48964) = 1

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

How to find the GCF of 48953 and 48964?

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

Step-1: Prime Factorization of 48953

Prime factors of 48953 are 48953. Prime factorization of 48953 in exponential form is:

48953 = 48953¹

Step-2: Prime Factorization of 48964

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

48964 = 2² × 12241¹

Step-3: Factors of 48953

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

Step-4: Factors of 48964

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

1, 2, 4, 12241, 24482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48953 and 48964