What is the Greatest Common Factor of 33952 and 33968?

Greatest common factor (GCF) of 33952 and 33968 is 16.

GCF(33952,33968) = 16

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

How to find the GCF of 33952 and 33968?

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

Step-1: Prime Factorization of 33952

Prime factors of 33952 are 2, 1061. Prime factorization of 33952 in exponential form is:

33952 = 2⁵ × 1061¹

Step-2: Prime Factorization of 33968

Prime factors of 33968 are 2, 11, 193. Prime factorization of 33968 in exponential form is:

33968 = 2⁴ × 11¹ × 193¹

Step-3: Factors of 33952

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

1, 2, 4, 8, 16, 32, 1061, 2122, 4244, 8488, 16976

Step-4: Factors of 33968

List of positive integer factors of 33968 that divides 33952 without a remainder.

1, 2, 4, 8, 11, 16, 22, 44, 88, 176, 193, 386, 772, 1544, 2123, 3088, 4246, 8492, 16984

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 33952 and 33968. The biggest common factor number is the GCF number.
So the greatest common factor 33952 and 33968 is 16.

Also check out the Least Common Multiple of 33952 and 33968