3

From Zero to Engineer

Divisors, prime factorization, GCD and LCM

Review exercises on the order of operations and rounding, what divisors and prime numbers are, how to factorize a number into primes, and how to read the GCD and LCM from a factorization.

A divisor is a number that divides another without a remainder. Divisors lead to prime numbers, primes lead to factorization, and from a factorization you can read off the GCD and LCM. This lesson walks through that whole chain on concrete numbers.

Review exercises

1) Place the appropriate symbols (< or >) between each of the following pairs of numbers

1>6-1 > -6
5>295 > -29
14<7-14 < 7

2) Calculate the value of each of the following expressions

16124+8:2=1648+4=32+4=2816 - 12 \cdot 4 + 8 : 2 = 16 - 48 + 4 = -32 + 4 = -28
(1612)(4+8):2=412:2=48:2=24(16 - 12) \cdot (4 + 8) : 2 = 4 \cdot 12 : 2 = 48 : 2 = 24
93[17+5(57)]=93[17+5(2)]=93[1710]=937=921=12\begin{aligned}9 - 3[17 + 5(5 - 7)] &= 9 - 3[17 + 5 \cdot (-2)] \\&= 9 - 3[17 - 10] = 9 - 3 \cdot 7 \\&= 9 - 21 = -12\end{aligned}
8[3(2+4)2(5+7)]=8[36212]=8[1824]=8(6)=48\begin{aligned}8[3(2 + 4) - 2(5 + 7)] &= 8[3 \cdot 6 - 2 \cdot 12] \\&= 8[18 - 24] = 8 \cdot (-6) = -48\end{aligned}

3) Prove that

6(32)(63)26 - (3 - 2) \neq (6 - 3) - 2
6132516 - 1 \neq 3 - 2 \quad\Rightarrow\quad 5 \neq 1
24:(2+6)(24:2)+(24:6)24 : (2 + 6) \neq (24 : 2) + (24 : 6)
24:812+431624 : 8 \neq 12 + 4 \quad\Rightarrow\quad 3 \neq 16
100:(10:5)(100:10):5100 : (10 : 5) \neq (100 : 10) : 5
100:210:5502100 : 2 \neq 10 : 5 \quad\Rightarrow\quad 50 \neq 2
24:(26)(24:2)(24:6)24 : (2 - 6) \neq (24 : 2) - (24 : 6)
24:(4)1246824 : (-4) \neq 12 - 4 \quad\Rightarrow\quad -6 \neq 8

4) Round each number to the nearest 10, 100, and 1,000

numberto 10to 100to 1,000
2562256026003000
1500150015002000
−3451−3450−3500−3000
−14525−14530−14500−15000

Factors and divisors

Factors are a pair of numbers whose product equals a given number.

36=183 \cdot 6 = 18

A divisor is an integer that divides another number without a remainder.

the divisors of 1818 are 1, 2, 3, 6, 9, 181,\ 2,\ 3,\ 6,\ 9,\ 18

the divisors of 1212 are 1, 2, 3, 4, 6, 121,\ 2,\ 3,\ 4,\ 6,\ 12

the divisors of 2525 are 1, 5, 251,\ 5,\ 25

the divisors of 1717 are 1, 171,\ 17

Seventeen is an example of a prime number.

A prime number has exactly two divisors: 1 and itself. Other prime numbers are 2, 3, 5, 7, 11, 13 …

Prime factorization

Every natural number can be expressed as a product of prime factors only.

1262
633
213
77
1
126=2337126 = 2 \cdot 3 \cdot 3 \cdot 7
842
422
213
77
1
84=223784 = 2 \cdot 2 \cdot 3 \cdot 7
5122
2562
1282
642
322
162
82
42
22
1
512=222222222512 = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2

Greatest common divisor (GCD) and least common multiple (LCM)

1442
722
362
182
93
33
1
144=222233144 = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 3 \cdot 3
662
333
1111
1
66=231166 = 2 \cdot 3 \cdot 11
GCD(144; 66)=23=6\mathrm{GCD}(144;\ 66) = 2 \cdot 3 = 6
LCM(144; 66)=22223311=1584\mathrm{LCM}(144;\ 66) = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 3 \cdot 3 \cdot 11 = 1584
GCD(84; 512)=22=4\mathrm{GCD}(84;\ 512) = 2 \cdot 2 = 4
LCM(84; 512)=22222222237=10752\mathrm{LCM}(84;\ 512) = 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 2 \cdot 3 \cdot 7 = 10752

Frequently asked questions

How do you factorize a number into primes?

Divide the number by successive prime numbers, starting from the smallest, writing each quotient underneath. Repeat until you reach one. The factors in the right column form the factorization, for example 126 = 2 · 3 · 3 · 7.

How do you find the GCD and LCM from a factorization?

The GCD is the product of the factors common to both numbers; the LCM is the product of all factors, taking each repeated factor as many times as it appears at most in one factorization. For 144 and 66 that gives a GCD of 6 and an LCM of 1584.

How many divisors does a prime number have?

Exactly two: one and itself. That is why 17 is prime and 12 is not, since it is also divisible by 2, 3, 4 and 6.

PhiBoard

A modern, interactive board for study and work. Create, teach and collaborate - completely free.

Coming soon to

Google Play

Download on the

App Store

PhiBoard

Tools

Capabilities

Knowledge base

Support

FAQ

Our mission

Contact

More

Our goalFor schoolsNews

Documents

TermsPrivacy policy

office@phiboard.com

Support the project

© 2026 PhiBoard. All rights reserved.

We Use Cookies

To improve the quality of our services, we use cookies. Cookies help us tailor our website to your preferences, analyze how you use the site, and provide a better user experience. By accepting cookies, you consent to their use for optimizing functionality and content on the site.

Divisors, prime factorization, GCD and LCM | PhiBoard