What is the Greatest Common Factor of 49752 and 49765?

Greatest common factor (GCF) of 49752 and 49765 is 1.

GCF(49752,49765) = 1

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

How to find the GCF of 49752 and 49765?

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

Step-1: Prime Factorization of 49752

Prime factors of 49752 are 2, 3, 691. Prime factorization of 49752 in exponential form is:

49752 = 2³ × 3² × 691¹

Step-2: Prime Factorization of 49765

Prime factors of 49765 are 5, 37, 269. Prime factorization of 49765 in exponential form is:

49765 = 5¹ × 37¹ × 269¹

Step-3: Factors of 49752

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

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 691, 1382, 2073, 2764, 4146, 5528, 6219, 8292, 12438, 16584, 24876

Step-4: Factors of 49765

List of positive integer factors of 49765 that divides 49752 without a remainder.

1, 5, 37, 185, 269, 1345, 9953

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49752 and 49765