What is the Greatest Common Factor of 48362 and 48373?

Greatest common factor (GCF) of 48362 and 48373 is 1.

GCF(48362,48373) = 1

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

How to find the GCF of 48362 and 48373?

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

Step-1: Prime Factorization of 48362

Prime factors of 48362 are 2, 24181. Prime factorization of 48362 in exponential form is:

48362 = 2¹ × 24181¹

Step-2: Prime Factorization of 48373

Prime factors of 48373 are 13, 61. Prime factorization of 48373 in exponential form is:

48373 = 13¹ × 61²

Step-3: Factors of 48362

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

1, 2, 24181

Step-4: Factors of 48373

List of positive integer factors of 48373 that divides 48362 without a remainder.

1, 13, 61, 793, 3721

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48362 and 48373