What is the Greatest Common Factor of 48564 and 48569?

Greatest common factor (GCF) of 48564 and 48569 is 1.

GCF(48564,48569) = 1

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

How to find the GCF of 48564 and 48569?

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

Step-1: Prime Factorization of 48564

Prime factors of 48564 are 2, 3, 19, 71. Prime factorization of 48564 in exponential form is:

48564 = 2² × 3² × 19¹ × 71¹

Step-2: Prime Factorization of 48569

Prime factors of 48569 are 17, 2857. Prime factorization of 48569 in exponential form is:

48569 = 17¹ × 2857¹

Step-3: Factors of 48564

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

1, 2, 3, 4, 6, 9, 12, 18, 19, 36, 38, 57, 71, 76, 114, 142, 171, 213, 228, 284, 342, 426, 639, 684, 852, 1278, 1349, 2556, 2698, 4047, 5396, 8094, 12141, 16188, 24282

Step-4: Factors of 48569

List of positive integer factors of 48569 that divides 48564 without a remainder.

1, 17, 2857

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48564 and 48569