Number System Solved Questions

Number System questions reward knowing a handful of divisibility shortcuts and a few standard counting formulas — summation formulas, unit-digit cycles, trailing zeros in a factorial, and the number of factors of an integer — so you never need to compute a huge number in full. This page covers all of these, with several fully worked examples.

Written by Mahesh Srivastava, Founder of Pariksha Saathi. Published: 2026-10-03. Editorial standards & corrections

Jump to practice questions ↓

The concept, quickly

  • Divisibility rules let you check whether a number is divisible by a small number without doing the division: by 2 if the last digit is even; by 3 if the digit sum is divisible by 3; by 4 if the last two digits form a number divisible by 4; by 5 if the last digit is 0 or 5; by 9 if the digit sum is divisible by 9; by 11 if the difference between the sum of digits in odd and even positions (counting from the right) is divisible by 11.
  • When a number N is divided by a divisor D, N = D × Q + R, where Q is the quotient and R is the remainder, with 0 ≤ R < D. This relationship is the foundation of every remainder question.
  • Remainders behave predictably under addition and multiplication: you can take the remainder of each piece first, rather than computing a huge expression in full — useful for "find the remainder of a large power" questions, where the remainders of successive powers usually repeat in a short cycle.
  • A number is a perfect square if every exponent in its prime factorization is even; it’s a perfect cube if every exponent is a multiple of 3.
  • Useful summation formulas: sum of the first n natural numbers = n(n+1)/2; sum of the first n squares = n(n+1)(2n+1)/6; sum of the first n cubes = [n(n+1)/2]².
  • To find the unit digit of aⁿ, find the (short) cycle of unit digits that powers of a repeat through, then use n mod (cycle length) to pick the right position — if that remainder comes out to 0, it points to the LAST entry of the cycle, not necessarily a’s own unit digit.
  • Number of trailing zeros in n! = how many times 5 divides into the numbers from 1 to n (count multiples of 5, then 25, then 125, … and add). Count only the 5s, not the 2s — a factorial always has more factors of 2 than of 5, so the 5s are the limiting factor.
  • Number of factors of N, once you have its prime factorization N = p₁^a × p₂^b × …, is (a+1) × (b+1) × … — each exponent contributes its own count of choices (0 through that exponent), multiplied together.

Worked examples

1. Check whether 4,572 is divisible by 9.

Solution

  1. Digit sum = 4 + 5 + 7 + 2 = 18.
  2. 18 is divisible by 9, so 4,572 is divisible by 9.

Answer: Yes, divisible by 9

2. Check whether 9,251 is divisible by 11.

Solution

  1. From the right: position 1 = 1, position 2 = 5, position 3 = 2, position 4 = 9.
  2. Sum of odd positions (1st, 3rd) = 1 + 2 = 3. Sum of even positions (2nd, 4th) = 5 + 9 = 14.
  3. Difference = |3 − 14| = 11, which is divisible by 11 — so 9,251 is divisible by 11.

Answer: Yes, divisible by 11

3. Find the remainder when 7¹⁰⁰ is divided by 5.

Solution

  1. Find the pattern of 7ⁿ mod 5: 7¹ mod 5 = 2, 7² mod 5 = 4, 7³ mod 5 = 3, 7⁴ mod 5 = 1, and then it repeats — a cycle of length 4.
  2. 100 ÷ 4 leaves no remainder, so 7¹⁰⁰ lands on the 4th position in the cycle: remainder 1.

Answer: 1

4. A number, when divided by 15, leaves a remainder of 7. Find the remainder when the same number is divided by 5.

Solution

  1. The number is N = 15Q + 7 for some quotient Q. Since 15 is a multiple of 5, the term 15Q is exactly divisible by 5.
  2. So the remainder on dividing N by 5 is just 7 mod 5 = 2. (Check with Q = 1: N = 22, and 22 ÷ 5 leaves remainder 2.)

Answer: 2

5. Find the sum of the first 20 natural numbers, the sum of their squares, and the sum of their cubes.

Solution

  1. Sum of first n numbers = n(n+1)/2 = 20 × 21 / 2 = 210.
  2. Sum of first n squares = n(n+1)(2n+1)/6 = (20 × 21 × 41) / 6 = 17,220 / 6 = 2,870.
  3. Sum of first n cubes = [n(n+1)/2]² = 210² = 44,100.

Answer: Sum = 210, Sum of squares = 2,870, Sum of cubes = 44,100

6. Find the unit digit of 7⁹⁵.

Solution

  1. Unit digits of powers of 7 cycle every 4 steps: 7¹→7, 7²→9, 7³→3, 7⁴→1, then repeat.
  2. 95 = 4 × 23 + 3, so the remainder is 3 — this points to the 3rd entry in the cycle.
  3. The 3rd entry is 3.

Answer: 3

7. Find the number of trailing zeros in 100!.

Solution

  1. Count multiples of 5 up to 100: ⌊100/5⌋ = 20.
  2. Count multiples of 25 up to 100 (each contributes one extra factor of 5): ⌊100/25⌋ = 4.
  3. Multiples of 125 up to 100: 0, since 125 > 100.
  4. Total trailing zeros = 20 + 4 = 24.

Answer: 24

8. Find the number of factors of 360.

Solution

  1. 360 = 2³ × 3² × 5¹.
  2. Number of factors = (3+1) × (2+1) × (1+1) = 4 × 3 × 2
  3. = 24

Answer: 24

Try these yourself

Work through these the same way, then check against the answer.

1. Check whether 3,684 is divisible by 4.

Answer: Yes (last two digits, 84, are divisible by 4)

2. Check whether 61,809 is divisible by 11.

Answer: Yes (odd-position sum 23 minus even-position sum 1 = 22, divisible by 11)

3. A number, when divided by 24, leaves a remainder of 11. Find the remainder when the same number is divided by 8.

Answer: 3

4. Find the sum of the first 15 natural numbers and the sum of their squares.

Answer: Sum = 120, Sum of squares = 1,240. 15×16/2 = 120; (15×16×31)/6 = 7,440/6.

5. Find the unit digit of 8⁵³.

Answer: 8. Cycle of 8 is 8,4,2,6 (length 4); 53 = 4×13+1, so the 1st entry, which is 8.

6. Find the number of trailing zeros in 50!.

Answer: 12. ⌊50/5⌋ + ⌊50/25⌋ = 10 + 2.

7. Find the number of factors of 180.

Answer: 18. 180 = 2²×3²×5¹; (2+1)(2+1)(1+1) = 3×3×2.

All 21 practice questions on Number System, with answers →

Where this comes up

Number System is named in the quantitative, numerical or mathematics syllabus of SSC CGL, SSC MTS, SSC CHSL, SSC GD Constable, RRB NTPC, RRB Group D, RRB ALP, UP Police Constable, BSSC Inter Level, Haryana CET and DSSSB TGT among the exams Pariksha Saathi covers (for any other exam, check your own exam’s official notification) — a foundational topic that underlies Simplification, Approximation and several other Quantitative Aptitude topics.

Keep practising

Solve the questions above before opening the answers. Explain each step in your own words, then revisit any mistakes.

Start this topic’s quiz →

Explore the lesson library