What is the Greatest Common Factor of 48536 and 48545?

Greatest common factor (GCF) of 48536 and 48545 is 1.

GCF(48536,48545) = 1

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

How to find the GCF of 48536 and 48545?

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

Step-1: Prime Factorization of 48536

Prime factors of 48536 are 2, 6067. Prime factorization of 48536 in exponential form is:

48536 = 2³ × 6067¹

Step-2: Prime Factorization of 48545

Prime factors of 48545 are 5, 7, 19, 73. Prime factorization of 48545 in exponential form is:

48545 = 5¹ × 7¹ × 19¹ × 73¹

Step-3: Factors of 48536

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

1, 2, 4, 8, 6067, 12134, 24268

Step-4: Factors of 48545

List of positive integer factors of 48545 that divides 48536 without a remainder.

1, 5, 7, 19, 35, 73, 95, 133, 365, 511, 665, 1387, 2555, 6935, 9709

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48536 and 48545