Skip to content
Calcapedia
Print as
Number of problems

In the print window, choose “Save as PDF” as the printer (or print it on paper). Seed 1 rebuilds this exact sheet.

Showing 10 problems, seed 1.

Factors worksheet

Grade 4 · CCSS 4.OA.B.4

Solve each problem and show your work. Round answers to 2 decimal places where needed.

  1. Problem 1.
    • Whole number: 55

    Find: Number of factors

  2. Problem 2.
    • Whole number: 70

    Find: Number of factors

  3. Problem 3.
    • Whole number: 46

    Find: Number of factors

  4. Problem 4.
    • Whole number: 50

    Find: Number of factors

  5. Problem 5.
    • Whole number: 40

    Find: Number of factors

  6. Problem 6.
    • Whole number: 64

    Find: Number of factors

  7. Problem 7.
    • Whole number: 72

    Find: Number of factors

  8. Problem 8.
    • Whole number: 52

    Find: Number of factors

  9. Problem 9.
    • Whole number: 45

    Find: Number of factors

  10. Problem 10.
    • Whole number: 49

    Find: Number of factors

Answer key: Factors worksheet

  1. 1. Number of factors: 4

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      55=5 × 11
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(1+1)×(1+1)=4
    3. Pair each small factor d (up to √55, the square root) with its partner 55 ÷ d. Every factor appears in exactly one pair

      1 × 55, 5 × 11
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=52−15−1×112−111−1=72
    5. Leave out the number itself to get the sum of its proper factors

      72−55=17
  2. 2. Number of factors: 8

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      70=2 × 5 × 7
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(1+1)×(1+1)×(1+1)=8
    3. Pair each small factor d (up to √70, the square root) with its partner 70 ÷ d. Every factor appears in exactly one pair

      1 × 70, 2 × 35, 5 × 14, 7 × 10
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=22−12−1×52−15−1×72−17−1=144
    5. Leave out the number itself to get the sum of its proper factors

      144−70=74
  3. 3. Number of factors: 4

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      46=2 × 23
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(1+1)×(1+1)=4
    3. Pair each small factor d (up to √46, the square root) with its partner 46 ÷ d. Every factor appears in exactly one pair

      1 × 46, 2 × 23
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=22−12−1×232−123−1=72
    5. Leave out the number itself to get the sum of its proper factors

      72−46=26
  4. 4. Number of factors: 6

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      50=2 × 5²
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(1+1)×(2+1)=6
    3. Pair each small factor d (up to √50, the square root) with its partner 50 ÷ d. Every factor appears in exactly one pair

      1 × 50, 2 × 25, 5 × 10
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=22−12−1×53−15−1=93
    5. Leave out the number itself to get the sum of its proper factors

      93−50=43
  5. 5. Number of factors: 8

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      40=2³ × 5
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(3+1)×(1+1)=8
    3. Pair each small factor d (up to √40, the square root) with its partner 40 ÷ d. Every factor appears in exactly one pair

      1 × 40, 2 × 20, 4 × 10, 5 × 8
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=24−12−1×52−15−1=90
    5. Leave out the number itself to get the sum of its proper factors

      90−40=50
  6. 6. Number of factors: 7

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      64=2⁶
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(6+1)=7
    3. Pair each small factor d (up to √64, the square root) with its partner 64 ÷ d. One pair repeats a factor, because the number is a perfect square

      1 × 64, 2 × 32, 4 × 16, 8 × 8
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=27−12−1=127
    5. Leave out the number itself to get the sum of its proper factors

      127−64=63
  7. 7. Number of factors: 12

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      72=2³ × 3²
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(3+1)×(2+1)=12
    3. Pair each small factor d (up to √72, the square root) with its partner 72 ÷ d. Every factor appears in exactly one pair

      1 × 72, 2 × 36, 3 × 24, 4 × 18, 6 × 12, 8 × 9
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=24−12−1×33−13−1=195
    5. Leave out the number itself to get the sum of its proper factors

      195−72=123
  8. 8. Number of factors: 6

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      52=2² × 13
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(2+1)×(1+1)=6
    3. Pair each small factor d (up to √52, the square root) with its partner 52 ÷ d. Every factor appears in exactly one pair

      1 × 52, 2 × 26, 4 × 13
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=23−12−1×132−113−1=98
    5. Leave out the number itself to get the sum of its proper factors

      98−52=46
  9. 9. Number of factors: 6

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      45=3² × 5
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(2+1)×(1+1)=6
    3. Pair each small factor d (up to √45, the square root) with its partner 45 ÷ d. Every factor appears in exactly one pair

      1 × 45, 3 × 15, 5 × 9
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=33−13−1×52−15−1=78
    5. Leave out the number itself to get the sum of its proper factors

      78−45=33
  10. 10. Number of factors: 3

    1. Break the number into primes. Every factor is built by picking how many of each prime to use, from none up to all of them

      49=7²
    2. Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply

      d(n)=(2+1)=3
    3. Pair each small factor d (up to √49, the square root) with its partner 49 ÷ d. One pair repeats a factor, because the number is a perfect square

      1 × 49, 7 × 7
    4. Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together

      σ(n)=73−17−1=57
    5. Leave out the number itself to get the sum of its proper factors

      57−49=8