What is the Greatest Common Factor of 3947 and 3952?

Greatest common factor (GCF) of 3947 and 3952 is 1.

GCF(3947,3952) = 1

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

How to find the GCF of 3947 and 3952?

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

Step-1: Prime Factorization of 3947

Prime factors of 3947 are 3947. Prime factorization of 3947 in exponential form is:

3947 = 3947¹

Step-2: Prime Factorization of 3952

Prime factors of 3952 are 2, 13, 19. Prime factorization of 3952 in exponential form is:

3952 = 2⁴ × 13¹ × 19¹

Step-3: Factors of 3947

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

Step-4: Factors of 3952

List of positive integer factors of 3952 that divides 3947 without a remainder.

1, 2, 4, 8, 13, 16, 19, 26, 38, 52, 76, 104, 152, 208, 247, 304, 494, 988, 1976

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 3947 and 3952