What is the Greatest Common Factor of 60947 and 60952?

Greatest common factor (GCF) of 60947 and 60952 is 1.

GCF(60947,60952) = 1

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

How to find the GCF of 60947 and 60952?

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

Step-1: Prime Factorization of 60947

Prime factors of 60947 are 59, 1033. Prime factorization of 60947 in exponential form is:

60947 = 59¹ × 1033¹

Step-2: Prime Factorization of 60952

Prime factors of 60952 are 2, 19, 401. Prime factorization of 60952 in exponential form is:

60952 = 2³ × 19¹ × 401¹

Step-3: Factors of 60947

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

1, 59, 1033

Step-4: Factors of 60952

List of positive integer factors of 60952 that divides 60947 without a remainder.

1, 2, 4, 8, 19, 38, 76, 152, 401, 802, 1604, 3208, 7619, 15238, 30476

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 60947 and 60952