What is the Greatest Common Factor of 36947 and 36964?

Greatest common factor (GCF) of 36947 and 36964 is 1.

GCF(36947,36964) = 1

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

How to find the GCF of 36947 and 36964?

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

Step-1: Prime Factorization of 36947

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

36947 = 36947¹

Step-2: Prime Factorization of 36964

Prime factors of 36964 are 2, 9241. Prime factorization of 36964 in exponential form is:

36964 = 2² × 9241¹

Step-3: Factors of 36947

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

Step-4: Factors of 36964

List of positive integer factors of 36964 that divides 36947 without a remainder.

1, 2, 4, 9241, 18482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 36947 and 36964