What is the Greatest Common Factor of 91956 and 91968?

Greatest common factor (GCF) of 91956 and 91968 is 12.

GCF(91956,91968) = 12

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

How to find the GCF of 91956 and 91968?

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

Step-1: Prime Factorization of 91956

Prime factors of 91956 are 2, 3, 79, 97. Prime factorization of 91956 in exponential form is:

91956 = 2² × 3¹ × 79¹ × 97¹

Step-2: Prime Factorization of 91968

Prime factors of 91968 are 2, 3, 479. Prime factorization of 91968 in exponential form is:

91968 = 2⁶ × 3¹ × 479¹

Step-3: Factors of 91956

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

1, 2, 3, 4, 6, 12, 79, 97, 158, 194, 237, 291, 316, 388, 474, 582, 948, 1164, 7663, 15326, 22989, 30652, 45978

Step-4: Factors of 91968

List of positive integer factors of 91968 that divides 91956 without a remainder.

1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192, 479, 958, 1437, 1916, 2874, 3832, 5748, 7664, 11496, 15328, 22992, 30656, 45984

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 91956 and 91968. The biggest common factor number is the GCF number.
So the greatest common factor 91956 and 91968 is 12.

Also check out the Least Common Multiple of 91956 and 91968