What is the Greatest Common Factor of 48035 and 48051?

Greatest common factor (GCF) of 48035 and 48051 is 1.

GCF(48035,48051) = 1

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

How to find the GCF of 48035 and 48051?

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

Step-1: Prime Factorization of 48035

Prime factors of 48035 are 5, 13, 739. Prime factorization of 48035 in exponential form is:

48035 = 5¹ × 13¹ × 739¹

Step-2: Prime Factorization of 48051

Prime factors of 48051 are 3, 19, 281. Prime factorization of 48051 in exponential form is:

48051 = 3² × 19¹ × 281¹

Step-3: Factors of 48035

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

1, 5, 13, 65, 739, 3695, 9607

Step-4: Factors of 48051

List of positive integer factors of 48051 that divides 48035 without a remainder.

1, 3, 9, 19, 57, 171, 281, 843, 2529, 5339, 16017

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48035 and 48051