Number system aptitude questions with solutions
Last updated 2026-11-19
The number system covers divisibility, remainders, factors, unit digits and sums of series. It is a short chapter, but the same few tricks (cycles, modular reduction and prime factorisation) solve a large share of the questions.
Below are the rules and 14 problems with full working. For related drills, see HCF and LCM and permutation and combination. For the overall plan, read how to crack an aptitude test.
Key formulas for the number system
- Divisible by 3 or 9: the sum of digits is divisible by 3 or 9. By 4: the last two digits are. By 8: the last three digits are. By 11: (sum of digits at odd places) - (sum at even places) is 0 or a multiple of 11.
- Number of factors of N = p^a × q^b × r^c is (a + 1)(b + 1)(c + 1).
- Sum of the first n natural numbers = n(n + 1)/2. Sum of squares = n(n + 1)(2n + 1)/6. Sum of the first n odd numbers = n².
- Unit digits repeat in cycles: 2, 3, 7 and 8 have a cycle of 4; 4 and 9 have a cycle of 2; 0, 1, 5, 6 never change.
- Number of trailing zeros in n! = floor(n/5) + floor(n/25) + floor(n/125) + ...
- Remainders: (a × b) mod m = ((a mod m) × (b mod m)) mod m. Use -1 as a remainder when it helps: 17 ≡ -1 (mod 18).
Shortcuts and common mistakes
- Reduce the base modulo the divisor first, and the exponent by the cycle length.
- For unit digit questions, use the exponent modulo 4 (replace 0 with 4).
- Remainders can be negative while working, as in 17 = -1 mod 18. Convert back at the end.
- To find the nearest number divisible by d, subtract the remainder from the number, or add (d - remainder).
Number system aptitude questions with solutions: questions with worked answers
1 Is 372,816 divisible by 9 and by 11?
easyDigit sum = 3 + 7 + 2 + 8 + 1 + 6 = 27, so it is divisible by 9. For 11: digits from the right at odd places 6, 8, 7 sum to 21; at even places 1, 2, 3 sum to 6. Difference = 15, which is not a multiple of 11. Final answer: divisible by 9, not by 11.
2 Find the unit digit of 7^23.
easyThe unit digits of powers of 7 cycle as 7, 9, 3, 1. 23 mod 4 = 3, so the third value applies. Final answer: 3.
3 Find the sum of the first 50 natural numbers.
easyn(n + 1)/2 = 50 × 51/2 = 1,275. Final answer: 1,275.
4 How many factors does 360 have?
easy360 = 2³ × 3² × 5. Number of factors = (3 + 1)(2 + 1)(1 + 1) = 4 × 3 × 2 = 24. Final answer: 24.
5 What is the smallest number that must be added to 1,000 to make it divisible by 13?
medium13 × 76 = 988, so 1,000 mod 13 = 12. Add 13 - 12 = 1. Check: 1,001 = 13 × 77. Final answer: 1.
6 Find the remainder when 2^100 is divided by 7.
medium2³ = 8 = 1 (mod 7), so powers of 2 repeat every 3. 100 mod 3 = 1, so 2^100 = 2 (mod 7). Final answer: 2.
7 A number leaves remainder 29 when divided by 56. What is the remainder when it is divided by 8?
medium56 is a multiple of 8, so the remainder mod 8 equals 29 mod 8 = 5. Final answer: 5.
8 How many zeros does 100! end with?
mediumfloor(100/5) + floor(100/25) = 20 + 4 = 24. Final answer: 24.
9 Find the sum of the squares of the first 10 natural numbers.
mediumn(n + 1)(2n + 1)/6 = 10 × 11 × 21/6 = 385. Final answer: 385.
10 Find the last two digits of 7^20.
hard7² = 49, 7⁴ = 2,401, which ends in 01. So 7^20 = (7⁴)^5 ends in 01. Final answer: 01.
11 Find the smallest 4-digit number divisible by 12, 15 and 20.
hardLCM = 60. 1,000/60 = 16.67, so the next multiple is 17 × 60 = 1,020. Final answer: 1,020.
12 Find the remainder when 17^200 is divided by 18.
hard17 = -1 (mod 18), so 17^200 = (-1)^200 = 1. Final answer: 1.
13 How many numbers between 100 and 300 are divisible by 7?
hardThe first is 105 and the last is 294. Count = (294 - 105)/7 + 1 = 27 + 1 = 28. Final answer: 28.
14 Find the remainder when 3^50 is divided by 5.
hardPowers of 3 modulo 5 cycle: 3, 4, 2, 1. 50 mod 4 = 2, so 3^50 = 4 (mod 5). Final answer: 4.
Frequently asked questions
What are the most tested number system topics?
Divisibility rules, unit digits, remainders, factors, and sums of series are the main ones.
How do I find a unit digit quickly?
Use the cycle of the base's last digit and reduce the exponent modulo 4.
What is the rule for 11?
The alternating digit sum must be 0 or a multiple of 11.
What should I study next?
HCF and LCM and permutation and combination. The Infosys interview guide covers the later rounds.
Related guides
More in Aptitude Questions for Placements
- One Word Substitution Aptitude Questions with Answers
- Para Jumbles Aptitude Questions with Solutions
- Partnership aptitude questions with solutions
- Percentage aptitude questions with solutions
- Permutation and combination aptitude questions
- Pipes and cisterns aptitude questions with solutions
- Probability aptitude questions with solutions
- Problems on ages aptitude questions with solutions
- Problems on trains aptitude questions with solutions
- Profit and loss aptitude questions with solutions
- Pseudocode Aptitude Questions with Output Tracing
- Quadratic equation aptitude questions