What is the Greatest Common Factor of 55935 and 55948?

Greatest common factor (GCF) of 55935 and 55948 is 1.

GCF(55935,55948) = 1

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

How to find the GCF of 55935 and 55948?

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

Step-1: Prime Factorization of 55935

Prime factors of 55935 are 3, 5, 11, 113. Prime factorization of 55935 in exponential form is:

55935 = 3² × 5¹ × 11¹ × 113¹

Step-2: Prime Factorization of 55948

Prime factors of 55948 are 2, 71, 197. Prime factorization of 55948 in exponential form is:

55948 = 2² × 71¹ × 197¹

Step-3: Factors of 55935

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

1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 113, 165, 339, 495, 565, 1017, 1243, 1695, 3729, 5085, 6215, 11187, 18645

Step-4: Factors of 55948

List of positive integer factors of 55948 that divides 55935 without a remainder.

1, 2, 4, 71, 142, 197, 284, 394, 788, 13987, 27974

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55935 and 55948