What is the Greatest Common Factor of 36951 and 36962?

Greatest common factor (GCF) of 36951 and 36962 is 1.

GCF(36951,36962) = 1

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

How to find the GCF of 36951 and 36962?

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

Step-1: Prime Factorization of 36951

Prime factors of 36951 are 3, 109, 113. Prime factorization of 36951 in exponential form is:

36951 = 3¹ × 109¹ × 113¹

Step-2: Prime Factorization of 36962

Prime factors of 36962 are 2, 18481. Prime factorization of 36962 in exponential form is:

36962 = 2¹ × 18481¹

Step-3: Factors of 36951

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

1, 3, 109, 113, 327, 339, 12317

Step-4: Factors of 36962

List of positive integer factors of 36962 that divides 36951 without a remainder.

1, 2, 18481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 36951 and 36962