What is the Greatest Common Factor of 48064 and 48079?

Greatest common factor (GCF) of 48064 and 48079 is 1.

GCF(48064,48079) = 1

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

How to find the GCF of 48064 and 48079?

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

Step-1: Prime Factorization of 48064

Prime factors of 48064 are 2, 751. Prime factorization of 48064 in exponential form is:

48064 = 2⁶ × 751¹

Step-2: Prime Factorization of 48079

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

48079 = 48079¹

Step-3: Factors of 48064

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

1, 2, 4, 8, 16, 32, 64, 751, 1502, 3004, 6008, 12016, 24032

Step-4: Factors of 48079

List of positive integer factors of 48079 that divides 48064 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48064 and 48079