What is the Greatest Common Factor of 48376 and 48393?

Greatest common factor (GCF) of 48376 and 48393 is 1.

GCF(48376,48393) = 1

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

How to find the GCF of 48376 and 48393?

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

Step-1: Prime Factorization of 48376

Prime factors of 48376 are 2, 6047. Prime factorization of 48376 in exponential form is:

48376 = 2³ × 6047¹

Step-2: Prime Factorization of 48393

Prime factors of 48393 are 3, 19, 283. Prime factorization of 48393 in exponential form is:

48393 = 3² × 19¹ × 283¹

Step-3: Factors of 48376

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

1, 2, 4, 8, 6047, 12094, 24188

Step-4: Factors of 48393

List of positive integer factors of 48393 that divides 48376 without a remainder.

1, 3, 9, 19, 57, 171, 283, 849, 2547, 5377, 16131

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48376 and 48393