What is the Greatest Common Factor of 1468 and 1479?

Greatest common factor (GCF) of 1468 and 1479 is 1.

GCF(1468,1479) = 1

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

How to find the GCF of 1468 and 1479?

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

Step-1: Prime Factorization of 1468

Prime factors of 1468 are 2, 367. Prime factorization of 1468 in exponential form is:

1468 = 2² × 367¹

Step-2: Prime Factorization of 1479

Prime factors of 1479 are 3, 17, 29. Prime factorization of 1479 in exponential form is:

1479 = 3¹ × 17¹ × 29¹

Step-3: Factors of 1468

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

1, 2, 4, 367, 734

Step-4: Factors of 1479

List of positive integer factors of 1479 that divides 1468 without a remainder.

1, 3, 17, 29, 51, 87, 493

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1468 and 1479