What is the Greatest Common Factor of 14953 and 14960?

Greatest common factor (GCF) of 14953 and 14960 is 1.

GCF(14953,14960) = 1

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

How to find the GCF of 14953 and 14960?

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

Step-1: Prime Factorization of 14953

Prime factors of 14953 are 19, 787. Prime factorization of 14953 in exponential form is:

14953 = 19¹ × 787¹

Step-2: Prime Factorization of 14960

Prime factors of 14960 are 2, 5, 11, 17. Prime factorization of 14960 in exponential form is:

14960 = 2⁴ × 5¹ × 11¹ × 17¹

Step-3: Factors of 14953

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

1, 19, 787

Step-4: Factors of 14960

List of positive integer factors of 14960 that divides 14953 without a remainder.

1, 2, 4, 5, 8, 10, 11, 16, 17, 20, 22, 34, 40, 44, 55, 68, 80, 85, 88, 110, 136, 170, 176, 187, 220, 272, 340, 374, 440, 680, 748, 880, 935, 1360, 1496, 1870, 2992, 3740, 7480

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14953 and 14960