What is the Greatest Common Factor of 48352 and 48369?

Greatest common factor (GCF) of 48352 and 48369 is 1.

GCF(48352,48369) = 1

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

How to find the GCF of 48352 and 48369?

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

Step-1: Prime Factorization of 48352

Prime factors of 48352 are 2, 1511. Prime factorization of 48352 in exponential form is:

48352 = 2⁵ × 1511¹

Step-2: Prime Factorization of 48369

Prime factors of 48369 are 3, 23, 701. Prime factorization of 48369 in exponential form is:

48369 = 3¹ × 23¹ × 701¹

Step-3: Factors of 48352

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

1, 2, 4, 8, 16, 32, 1511, 3022, 6044, 12088, 24176

Step-4: Factors of 48369

List of positive integer factors of 48369 that divides 48352 without a remainder.

1, 3, 23, 69, 701, 2103, 16123

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48352 and 48369