What is the Greatest Common Factor of 33951 and 33964?

Greatest common factor (GCF) of 33951 and 33964 is 1.

GCF(33951,33964) = 1

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

How to find the GCF of 33951 and 33964?

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

Step-1: Prime Factorization of 33951

Prime factors of 33951 are 3, 11317. Prime factorization of 33951 in exponential form is:

33951 = 3¹ × 11317¹

Step-2: Prime Factorization of 33964

Prime factors of 33964 are 2, 7, 1213. Prime factorization of 33964 in exponential form is:

33964 = 2² × 7¹ × 1213¹

Step-3: Factors of 33951

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

1, 3, 11317

Step-4: Factors of 33964

List of positive integer factors of 33964 that divides 33951 without a remainder.

1, 2, 4, 7, 14, 28, 1213, 2426, 4852, 8491, 16982

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 33951 and 33964