What is the Greatest Common Factor of 48051 and 48065?

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

GCF(48051,48065) = 1

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

How to find the GCF of 48051 and 48065?

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

Step-1: 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-2: Prime Factorization of 48065

Prime factors of 48065 are 5, 9613. Prime factorization of 48065 in exponential form is:

48065 = 5¹ × 9613¹

Step-3: Factors of 48051

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

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

Step-4: Factors of 48065

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

1, 5, 9613

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48051 and 48065