Name Date
Factors worksheet
Grade 4 · CCSS 4.OA.B.4
Calcapedia Solve each problem and show your work. Round answers to 2 decimal places where needed.
- 1.
Problem 1. Find: Number of factors
Answer
- 2.
Problem 2. Find: Number of factors
Answer
- 3.
Problem 3. Find: Number of factors
Answer
- 4.
Problem 4. Find: Number of factors
Answer
- 5.
Problem 5. Find: Number of factors
Answer
- 6.
Problem 6. Find: Number of factors
Answer
- 7.
Problem 7. Find: Number of factors
Answer
- 8.
Problem 8. Find: Number of factors
Answer
- 9.
Problem 9. Find: Number of factors
Answer
- 10.
Problem 10. Find: Number of factors
Answer
Answer key: Factors worksheet
Calcapedia 1. Number of factors: 4
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √55, the square root) with its partner 55 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
2. Number of factors: 8
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √70, the square root) with its partner 70 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
3. Number of factors: 4
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √46, the square root) with its partner 46 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
4. Number of factors: 6
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √50, the square root) with its partner 50 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
5. Number of factors: 8
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √40, the square root) with its partner 40 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
6. Number of factors: 7
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
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
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
7. Number of factors: 12
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √72, the square root) with its partner 72 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
8. Number of factors: 6
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √52, the square root) with its partner 52 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
9. Number of factors: 6
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
Pair each small factor d (up to √45, the square root) with its partner 45 ÷ d. Every factor appears in exactly one pair
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors
10. Number of factors: 3
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
Count the factors (d(n)): add 1 to each prime's power, since using none counts too, then multiply
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
Add up all the factors (σ(n)) with a shortcut: one fraction per prime, multiplied together
Leave out the number itself to get the sum of its proper factors