What is the Greatest Common Factor of 15936 and 15953?

Greatest common factor (GCF) of 15936 and 15953 is 1.

GCF(15936,15953) = 1

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

How to find the GCF of 15936 and 15953?

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

Step-1: Prime Factorization of 15936

Prime factors of 15936 are 2, 3, 83. Prime factorization of 15936 in exponential form is:

15936 = 2⁶ × 3¹ × 83¹

Step-2: Prime Factorization of 15953

Prime factors of 15953 are 7, 43, 53. Prime factorization of 15953 in exponential form is:

15953 = 7¹ × 43¹ × 53¹

Step-3: Factors of 15936

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

1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 83, 96, 166, 192, 249, 332, 498, 664, 996, 1328, 1992, 2656, 3984, 5312, 7968

Step-4: Factors of 15953

List of positive integer factors of 15953 that divides 15936 without a remainder.

1, 7, 43, 53, 301, 371, 2279

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15936 and 15953