What is the Greatest Common Factor of 48752 and 48765?

Greatest common factor (GCF) of 48752 and 48765 is 1.

GCF(48752,48765) = 1

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

How to find the GCF of 48752 and 48765?

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

Step-1: Prime Factorization of 48752

Prime factors of 48752 are 2, 11, 277. Prime factorization of 48752 in exponential form is:

48752 = 2⁴ × 11¹ × 277¹

Step-2: Prime Factorization of 48765

Prime factors of 48765 are 3, 5, 3251. Prime factorization of 48765 in exponential form is:

48765 = 3¹ × 5¹ × 3251¹

Step-3: Factors of 48752

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

1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 277, 554, 1108, 2216, 3047, 4432, 6094, 12188, 24376

Step-4: Factors of 48765

List of positive integer factors of 48765 that divides 48752 without a remainder.

1, 3, 5, 15, 3251, 9753, 16255

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48752 and 48765