What is the Greatest Common Factor of 47948 and 47955?

Greatest common factor (GCF) of 47948 and 47955 is 1.

GCF(47948,47955) = 1

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

How to find the GCF of 47948 and 47955?

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

Step-1: Prime Factorization of 47948

Prime factors of 47948 are 2, 11987. Prime factorization of 47948 in exponential form is:

47948 = 2² × 11987¹

Step-2: Prime Factorization of 47955

Prime factors of 47955 are 3, 5, 23, 139. Prime factorization of 47955 in exponential form is:

47955 = 3¹ × 5¹ × 23¹ × 139¹

Step-3: Factors of 47948

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

1, 2, 4, 11987, 23974

Step-4: Factors of 47955

List of positive integer factors of 47955 that divides 47948 without a remainder.

1, 3, 5, 15, 23, 69, 115, 139, 345, 417, 695, 2085, 3197, 9591, 15985

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47948 and 47955