Skip to main content
Mathematics LibreTexts

1.3: Prime Factorization

  • Page ID
    49339
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Overview

    • Prime And Composite Numbers
    • The Fundamental Principle Of Arithmetic
    • The Prime Factorization Of A Whole Number

    Prime And Composite Numbers

    Notice that the only factors of 7 are 1 and 7 itself, and that the only factors of 23 are 1 and 23 itself.

    Definition: Prime Number

    A whole number greater than 1 whose only whole number factors are itself and 1 is called a prime number.

    The first seven prime numbers are

    2, 3, 5, 7, 11, 13, and 17

    The number 1 is not considered to be a prime number, and the number 2 is the first and only even prime number.
    Many numbers have factors other than themselves and 1. For example, the factors of 28 are 1, 2, 4, 7, 14, and 28 (since each of these whole numbers and only these whole numbers divide into 28 without a remainder).

    Definition: Composite Number

    A whole number that is composed of factors other than itself and 1 is called a composite number. Composite numbers are not prime numbers.


    Some composite numbers are 4, 6, 8, 10, 12, and 15.

    The Fundamental Principle Of Arithmetic

    Prime numbers are very important in the study of mathematics. We will use them soon in our study of fractions. We will now, however, be introduced to an important mathematical principle.

    Definition: The Fundamental Principle of Arithmetic

    Except for the order of the factors, every whole number, other than 1, can be factored in one and only one way as a product of prime numbers.

    Definition: Prime factorization

    When a number is factored so that all its factors are prime numbers, the factorization is called the prime factorization of the number.

    Sample Set A

    Example \(\PageIndex{1}\)

    Find the prime factorization of 10.

    \(10=2 · 5\)

    Both 2 and 5 are prime numbers. Thus, 2 · 5 is the prime factorization of 10.

    Example \(\PageIndex{2}\)

    Find the prime factorization of 60.

    60 = 2 · 30 30 is not prime. 30 = 2 · 15

    = 2 · 2 · 15 15 is not prime. 15 = 3 · 5

    = 2 · 2 · 3 · 5 We'll use exponents. 2 · 2 = \(2^2\)

    = \(2^2\) · 3 · 5


    The numbers 2, 3, and 5 are all primes. Thus, 22 · 3 · 5 is the prime factorization of 60.

    Example \(\PageIndex{3}\)

    Find the prime factorization of 11.

    11 is a prime number. Prime factorization applies only to composite numbers.

    The Prime Factorization Of A Whole Number

    The following method provides a way of finding the prime factorization of a whole number. The examples that follow will use the method and make it more clear.

    1. Divide the number repeatedly by the smallest prime number that will divide into the number without a remainder.
    2. When the prime number used in step 1 no longer divides into the given number without a remainder, repeat the process with the next largest prime number.
    3. Continue this process until the quotient is 1.
    4. The prime factorization of the given number is the product of all these prime divisors.

    Sample Set B

    Example \(\PageIndex{4}\)

    Find the prime factorization of 60.

    Since 60 is an even number, it is divisible by 2. We will repeatedly divide by 2 until we no longer can (when we start getting a remainder). We shall divide in the following way.

    The prime factorization of sixty. See the longdesc for a full description.  

    30 is divisible by 2 again.

    15 is not divisible by 2, but is divisible by 3, the next largest prime.

    5 is not divisible by 3, but is divisible by 5, the next largest prime.

    The quotient is 1 so we stop the division process

    The prime factorization of 60 is the product of all these divisors.

    60 = 2 · 2 · 3 · 5 We will use exponents when possible

    60 = \(2^2\) · 3 · 5

    Example \(\PageIndex{5}\)

    Find the prime factorization of 441.

    Since 441 is an odd number, it is not divisible by 2. We’ll try 3, the next largest prime.

    The prime factorization of four hundred forty-one. See the longdesc for a full description.  

    147 is divisible by 3.

    49 is not divisible by 3 nor by 5, but by 7.

    7 is divisible by 7.

    The quotient is 1 so we stop the division process.

    The prime factorization of 441 is the product of all the divisors.

    441 = 3 · 3 · 7 · 7 We will use exponents when possible.

    441 = \(3^2\) · \(7^2\)

    Exercises

    For the following problems, determine which whole numbers are prime and which are composite.

    Exercise \(\PageIndex{1}\)

    23

    Answer

    prime

    Exercise \(\PageIndex{2}\)

    25

    Answer

    composite

    Exercise \(\PageIndex{3}\)

    27

    Answer

    composite

    Exercise \(\PageIndex{4}\)

    2

    Answer

    prime

    Exercise \(\PageIndex{5}\)

    3

    Answer

    prime

    Exercise \(\PageIndex{6}\)

    5

    Answer

    prime

    Exercise \(\PageIndex{7}\)

    7

    Answer

    prime

    Exercise \(\PageIndex{8}\)

    9

    Answer

    composite

    Exercise \(\PageIndex{9}\)

    11

    Answer

    prime

    Exercise \(\PageIndex{10}\)

    34

    Answer

    composite

    Exercise \(\PageIndex{11}\)

    55

    Answer

    composite

    Exercise \(\PageIndex{12}\)

    63

    Answer

    composite

    Exercise \(\PageIndex{13}\)

    1044

    Answer

    composite

    Exercise \(\PageIndex{14}\)

    339

    Answer

    composite

    Exercise \(\PageIndex{15}\)

    209

    Answer

    composite

    For the following problems, find the prime factorization of each whole number. Use exponents on repeated factors.

    Exercise \(\PageIndex{16}\)

    26

    Exercise \(\PageIndex{17}\)

    38

    Answer

    2 · 19

    Exercise \(\PageIndex{18}\)

    54

    Exercise \(\PageIndex{19}\)

    62

    Answer

    2 · 31

    Exercise \(\PageIndex{20}\)

    56

    Exercise \(\PageIndex{21}\)

    176

    Answer

    \(2^4\) · \(11\)

    Exercise \(\PageIndex{22}\)

    480

    Exercise \(\PageIndex{23}\)

    819

    Answer

    \(3^2\) · \(7\) · \(13\)

    Exercise \(\PageIndex{24}\)

    2025

    Exercise \(\PageIndex{25}\)

    148,225

    Answer

    \(5^2\) · \(7^2\) · \(11^2\)


    This page titled 1.3: Prime Factorization is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by Denny Burzynski & Wade Ellis, Jr. (OpenStax CNX) .

    • Was this article helpful?