What is the Greatest Common Factor of 5952 and 5968?

Greatest common factor (GCF) of 5952 and 5968 is 16.

GCF(5952,5968) = 16

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

How to find the GCF of 5952 and 5968?

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

Step-1: Prime Factorization of 5952

Prime factors of 5952 are 2, 3, 31. Prime factorization of 5952 in exponential form is:

5952 = 2⁶ × 3¹ × 31¹

Step-2: Prime Factorization of 5968

Prime factors of 5968 are 2, 373. Prime factorization of 5968 in exponential form is:

5968 = 2⁴ × 373¹

Step-3: Factors of 5952

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

1, 2, 3, 4, 6, 8, 12, 16, 24, 31, 32, 48, 62, 64, 93, 96, 124, 186, 192, 248, 372, 496, 744, 992, 1488, 1984, 2976

Step-4: Factors of 5968

List of positive integer factors of 5968 that divides 5952 without a remainder.

1, 2, 4, 8, 16, 373, 746, 1492, 2984

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 5952 and 5968