GCF and LCM of 2 and 13

The GCF of 2 and 13 is 1. The LCM of 2 and 13 is 26.

• GCF (greatest common factor, also called GCD or HCF) of 2 and 13 = 1
• LCM (least common multiple) of 2 and 13 = 26

2 and 13 share no common factor except 1, so they are coprime (relatively prime). When two numbers are coprime their LCM is simply their product: 2 × 13 = 26.

Method 1: list the factors (GCF)

Factors of 2: 1, 2.
Factors of 13: 1, 13.
Common factors: 1. The greatest of these is 1.

Method 2: prime factorization

2 = 2 (prime)
13 = 13 (prime)

GCF: multiply the prime factors both numbers share: there are none, so the GCF is 1.

LCM: multiply every prime the maximum number of times it appears in either number: 2 × 13 = 26.

Method 3: Euclidean algorithm (GCF)

Divide the larger number by the smaller and repeat with the remainder until it is 0. The last non-zero remainder is the GCF.

1. 13 = 6 × 2 + 1
2. 2 = 2 × 1 + 0

The last non-zero remainder is 1, so GCF(2, 13) = 1.

LCM by listing multiples

Multiples of 2: 2, 4, 6, 8, 10, 12, 14, 16, 18, ...
Multiples of 13: 13, 26, 39, ...
The first number in both lists is 26.

Check: GCF × LCM = product

1 × 26 = 26 = 2 × 13. This always holds for two numbers, so you can find the LCM as (2 × 13) ÷ 1 = 26.

Simplifying the fraction 2/13

2/13 is already in lowest terms because the GCF of 2 and 13 is 1.

GCF and LCM of similar pairs

See also: factors of 2 · factors of 13 · 2/13 as a decimal.

Different numbers? Use the GCF and LCM calculator (any amount of numbers) or browse all GCF and LCM pairs.