Number System is the one quantitative topic where a single well-memorized shortcut can save 60 to 90 seconds per question. Yet it is also the chapter most aspirants prepare least systematically—picking up divisibility rules in isolation, memorizing a remainder trick here and there, and never building a unified mental framework for the entire topic.
The result is avoidable time loss and silly mistakes on questions that should be among the fastest to score in SSC CGL, RRB NTPC, IBPS PO/Clerk, TCS NQT, and Class 10 board exams.
This guide builds that complete, structured framework. It covers every high-weightage Number System sub-topic—divisibility (including composite divisors like 72 and 88), HCF, LCM, unit-digit cyclicity, remainders, factor counting, and consecutive number properties—with the fastest exam methods and step-by-step worked examples.
Part 1: Divisibility Rules — Complete Reference
Divisibility rules are the entry point for almost every Number System problem. Mastering them eliminates brute-force division and speeds up factor identification.
Standard Divisibility Rules (2 to 25)
Divisible by 2: The last digit is even ($0, 2, 4, 6,$ or $8$).
$4,738\ \checkmark$ | $5,931\ \times$
Divisible by 3: The sum of all digits is divisible by $3$.
$4,731 \rightarrow 4 + 7 + 3 + 1 = 15$ ($15 \div 3 = 5$)\ $\checkmark$
$4,735 \rightarrow 4 + 7 + 3 + 5 = 19$ (leaves remainder $1$)\ $\times$
Divisible by 4: The number formed by the last two digits is divisible by $4$.
$4,732 \rightarrow 32 \div 4 = 8\ \checkmark$ | $4,734 \rightarrow 34 \div 4 = 8.5\ \times$
Divisible by 5: The last digit is $0$ or $5$.
$4,735\ \checkmark$ | $4,733\ \times$
Divisible by 6: Divisible by both $2$ and $3$.
$4,734$: Even ($\checkmark$) and digit sum $= 18$ ($\div 3\ \checkmark$) $\rightarrow$ Divisible by $6\ \checkmark$
Divisible by 7: Double the last digit and subtract it from the remaining truncated number. Repeat until manageable.
$343 \rightarrow 34 - (3 \times 2) = 28$ ($28 \div 7 = 4$)\ $\checkmark$
$532 \rightarrow 53 - (2 \times 2) = 49$ ($49 \div 7 = 7$)\ $\checkmark$
$678 \rightarrow 67 - (8 \times 2) = 51$ (not divisible by $7$)\ $\times$
Divisible by 8: The number formed by the last three digits is divisible by $8$.
$4,736 \rightarrow 736 \div 8 = 92\ \checkmark$ | $4,734 \rightarrow 734 \div 8 = 91.75\ \times$
Divisible by 9: The sum of all digits is divisible by $9$.
$4,734 \rightarrow 4 + 7 + 3 + 4 = 18$ ($18 \div 9 = 2$)\ $\checkmark$
$4,731 \rightarrow \text{digit sum} = 15$ (leaves remainder $6$)\ $\times$
Divisible by 10: The last digit is $0$. ($4,730\ \checkmark$)
Divisible by 11: The difference between the sum of digits at odd positions and the sum of digits at even positions is $0$ or a multiple of $11$.
$4,741 \rightarrow \text{Odd } (4 + 4 = 8) - \text{Even } (7 + 1 = 8) = 0\ \checkmark$
$5,863 \rightarrow \text{Odd } (5 + 6 = 11) - \text{Even } (8 + 3 = 11) = 0\ \checkmark$
$9,427 \rightarrow \text{Odd } (9 + 2 = 11) - \text{Even } (4 + 7 = 11) = 0\ \checkmark$
Divisible by 12: Divisible by both $3$ and $4$.
$4,728 \rightarrow \text{Digit sum} = 21\ (\div 3\ \checkmark)$ and last two digits $28\ (\div 4\ \checkmark) \rightarrow\ \checkmark$
Divisible by 25: The last two digits are $00, 25, 50,$ or $75$. ($4,725\ \checkmark$ | $4,735\ \times$)
SSC CGL High-Yield Addition: Composite Divisors (72, 88, 99)
In SSC CGL Tier 1 and Tier 2, missing-digit problems almost always test composite co-prime divisors. Break the divisor into two co-prime factors:
Divisible by 72: Must be divisible by both $8$ and $9$ (check last 3 digits first, then digit sum).
Divisible by 88: Must be divisible by both $8$ and $11$ (check last 3 digits first, then alternating sum).
Divisible by 99: Must be divisible by both $9$ and $11$.
Part 2: HCF — Three Methods, One Best Choice
Method 1: Prime Factorization
Express each number as a product of prime powers, then multiply the common prime factors with their lowest exponents.
Example: Find $\text{HCF}(72, 120)$.
$72 = 2^3 \times 3^2$
$120 = 2^3 \times 3^1 \times 5^1$
$\text{HCF} = 2^3 \times 3^1 = \mathbf{24}$
Best for: Small numbers (under $100$) with obvious prime factors.
Method 2: Euclidean Division Algorithm (Fastest for Large Numbers)
Divide the larger number by the smaller number, then replace the larger number with the remainder and repeat until the remainder reaches $0$. The last non-zero divisor is the HCF.
Example 1: Find $\text{HCF}(252, 336)$.
$336 = 1 \times 252 + 84$
$252 = 3 \times 84 + 0 \rightarrow \text{HCF} = \mathbf{84}$
Example 2: Find $\text{HCF}(315, 525)$.
$525 = 1 \times 315 + 210$
$315 = 1 \times 210 + 105$
$210 = 2 \times 105 + 0 \rightarrow \text{HCF} = \mathbf{105}$
Best for: Any two 3-digit or 4-digit numbers under exam time pressure.
Method 3: Difference Method (For Close Numbers)
The HCF of two numbers always divides their difference. Subtract the smaller number from the larger to shrink the search immediately.
Example: Find $\text{HCF}(88, 99)$.
$99 - 88 = 11$. Since $11$ divides both $88$ and $99$, $\text{HCF} = \mathbf{11}$.
Best for: Numbers that lie close together (e.g., $437$ and $456$).
Part 3: LCM — The Fastest Methods
Method 1: Using the HCF-LCM Product Identity
$$\text{LCM}(a, b) = \frac{a \times b}{\text{HCF}(a, b)}$$
Example 1: Find $\text{LCM}(36, 48)$.
$\text{HCF}(36, 48) = 12 \rightarrow \text{LCM} = \frac{36 \times 48}{12} = 36 \times 4 = \mathbf{144}$
Example 2: Find $\text{LCM}(84, 120)$.
$\text{HCF}(84, 120) = 12 \rightarrow \text{LCM} = \frac{84 \times 120}{12} = 84 \times 10 = \mathbf{840}$
Method 2: Co-Prime Numbers
If $\text{HCF}(a, b) = 1$ (no common factors other than $1$), then $\text{LCM}(a, b) = a \times b$.
$\text{LCM}(7, 13) = \mathbf{91}$ | $\text{LCM}(8, 15) = \mathbf{120}$ | $\text{LCM}(11, 17) = \mathbf{187}$
Method 3: Direct Multiple Rule
If the smaller number divides the larger number completely, the larger number is the LCM.
$\text{LCM}(12, 36) = \mathbf{36}$ | $\text{LCM}(25, 100) = \mathbf{100}$
Method 4: LCM of Three or More Numbers
Pair the first two numbers, find their LCM, and then take the LCM of that result with the third number.
Example: Find $\text{LCM}(6, 10, 15)$.
$\text{LCM}(6, 10) = 30 \rightarrow \text{LCM}(30, 15) = \mathbf{30}$ (since $15$ divides $30$).
Bonus Formula: HCF & LCM of Fractions (RRB NTPC & SSC Staple)
$\text{HCF of Fractions} = \frac{\text{HCF of Numerators}}{\text{LCM of Denominators}}$
$\text{LCM of Fractions} = \frac{\text{LCM of Numerators}}{\text{HCF of Denominators}}$
Part 4: 6 Standard HCF & LCM Exam Problem Templates
Template 1: Largest Number Dividing Multiple Numbers Leaving the Same Remainder
Rule: $\text{HCF of } (\vert{}a - b\vert{}, \vert{}b - c\vert{}, \vert{}c - a\vert{})$
Worked Example: Find the largest number that divides $77, 147,$ and $252$ leaving the same remainder in each case.
Differences: $147 - 77 = 70$, $252 - 147 = 105$, $252 - 77 = 175$.
$\text{HCF}(70, 105, 175) = \mathbf{35}$.
Template 2: Largest Number Dividing Multiple Numbers Leaving Different Remainders
Rule: $\text{HCF of } (a - r_1,\ b - r_2,\ \dots)$
Worked Example: Find the largest number that divides $245$ and $1,029$ leaving remainders $5$ and $9$ respectively.
Subtract remainders: $245 - 5 = 240$ and $1,029 - 9 = 1,020$.
$\text{HCF}(240, 1,020) = \mathbf{60}$.
Template 3: Smallest Number Divisible by Multiple Numbers
Rule: $\text{LCM}(a, b, c)$
Worked Example: Find the smallest positive number completely divisible by $12, 18,$ and $30$.
$\text{LCM}(12, 18) = 36 \rightarrow \text{LCM}(36, 30) = \mathbf{180}$.
Template 4: Bells, Traffic Lights & Runners Coinciding
Rule: $\text{LCM of intervals}$ gives the exact time until the next simultaneous occurrence.
Worked Example: Three bells toll at intervals of $12, 18,$ and $24$ minutes. If they toll together at $8:00\text{ AM}$, when will they next toll together?
$\text{LCM}(12, 18, 24) = 72\text{ minutes} = 1\text{ hour } 12\text{ minutes}$.
Next toll together: $9:12\text{ AM}$.
Template 5: Smallest Number Leaving the Same Remainder $r$
Rule: $\text{LCM}(a, b, c) + r$
Worked Example: Find the smallest number which when divided by $12, 18,$ and $30$ always leaves a remainder of $7$.
$\text{LCM}(12, 18, 30) + 7 = 180 + 7 = \mathbf{187}$.
Template 6: Smallest Number Leaving a Constant Difference $k$
Rule: When $(a - r_1) = (b - r_2) = (c - r_3) = k$, the number is $\text{LCM}(a, b, c) - k$.
Worked Example: Find the smallest number which when divided by $12, 15,$ and $20$ leaves remainders $9, 12,$ and $17$ respectively.
Constant difference $k = 12 - 9 = 15 - 12 = 20 - 17 = 3$.
$\text{LCM}(12, 15, 20) - 3 = 60 - 3 = \mathbf{57}$.
Part 5: Unit Digit Patterns & Cyclicity
Unit-digit problems appear regularly in TCS NQT and SSC CGL. Every digit from $0$ to $9$ repeats its last digit in a fixed cycle of length $1, 2,$ or $4$ when raised to successive powers.
Unit Digit Cyclicity Table
Base Unit Digit | Repeating Cycle | Cyclicity Period |
|---|---|---|
$0$ | $0$ | $1$ |
$1$ | $1$ | $1$ |
$2$ | $2, 4, 8, 6$ | $4$ |
$3$ | $3, 9, 7, 1$ | $4$ |
$4$ | $4, 6$ | $2$ |
$5$ | $5$ | $1$ |
$6$ | $6$ | $1$ |
$7$ | $7, 9, 3, 1$ | $4$ |
$8$ | $8, 4, 2, 6$ | $4$ |
$9$ | $9, 1$ | $2$ |
4-Step Method & The "Remainder = 0" Trap
Look only at the unit digit of the base (ignore all preceding digits).
Find its cyclicity period ($1, 2,$ or $4$).
Divide the exponent by the period and note the remainder $r$.
Critical Trap: If the remainder $r = 0$ (the power is an exact multiple of the period), pick the last digit in the cycle (e.g., the 4th position for period $4$, or 2nd position for period $2$).
Worked Examples:
Example 1: Unit digit of $7^{45}$
Cycle of $7$: $(7, 9, 3, 1)$, period $= 4$.
$45 \bmod 4 = 1 \rightarrow$ 1st digit in cycle $= \mathbf{7}$.
Example 2: Unit digit of $3^{86}$
Cycle of $3$: $(3, 9, 7, 1)$, period $= 4$.
$86 \bmod 4 = 2 \rightarrow$ 2nd digit in cycle $= \mathbf{9}$.
Example 3: Unit digit of $4^{127}$
Cycle of $4$: $(4, 6)$, period $= 2$.
$127 \bmod 2 = 1 \rightarrow$ 1st digit in cycle $= \mathbf{4}$.
Example 4: Unit digit of $8^{99} \times 7^{45}$
For $8^{99}$: $99 \bmod 4 = 3 \rightarrow$ 3rd digit of $(8, 4, 2, 6)$ is $2$.
For $7^{45}$: as above, unit digit is $7$.
Product unit digit: $2 \times 7 = 14 \rightarrow \mathbf{4}$.
Part 6: Remainder Shortcuts
Trick 1: Remainder When Divided by $9$ or $3$ (Digital Root)
$\text{Remainder } (\div 9) =$ Digital Root of the number (keep summing digits until a single digit remains; treat $9$ as $0$).
$\text{Remainder } (\div 3) = (\text{Digit Sum}) \bmod 3$.
Examples:
$4,729 \div 9 \rightarrow 4 + 7 + 2 + 9 = 22 \rightarrow 2 + 2 = \mathbf{4}$ (Remainder $= 4$).
$7,654 \div 3 \rightarrow 7 + 6 + 5 + 4 = 22 \rightarrow 22 \bmod 3 = \mathbf{1}$ (Remainder $= 1$).
Trick 2: Remainder When Divided by $11$
Compute $(\text{Sum of odd-positioned digits from right}) - (\text{Sum of even-positioned digits from right})$. If negative, add $11$ until positive.
Example: Find the remainder of $4,729 \div 11$.
Odd positions (from right): $9 + 7 = 16$ | Even positions: $2 + 4 = 6$.
Difference: $16 - 6 = \mathbf{10}$ (Note: reading from left gives $(4 + 2) - (7 + 9) = -10$; adding $11$ gives the exact same remainder $\mathbf{10}$—always index positions from the units digit right-to-left to avoid sign errors!).
Trick 3: Negative Remainders (The Fastest Exam Shortcut)
If $17$ is divided by $18$, the positive remainder is $17$, while the negative remainder is $-1$ (since $17 = 18 \times 1 - 1$).
Example: Find the remainder when $17^{200}$ is divided by $18$.
Replace $17$ with $-1 \rightarrow (-1)^{200} = \mathbf{1}$.
Trick 4: Fermat's Little Theorem & Remainder Cyclicity
Fermat's Little Theorem: If $p$ is a prime number and $p$ does not divide $a$, then $a^{p-1} \div p$ always leaves remainder $1$.
$2^{10} \div 11 \rightarrow \text{Remainder} = \mathbf{1}$ | $3^{10} \div 11 \rightarrow \text{Remainder} = \mathbf{1}$.
Cyclicity of Remainders Example: Find the remainder when $7^{36}$ is divided by $5$.
$7^1 \bmod 5 = 2$, $7^2 \bmod 5 = 4$, $7^3 \bmod 5 = 3$, $7^4 \bmod 5 = 1$ (Cycle repeats every $4$ powers).
Since $36 \bmod 4 = 0$, take the 4th position in the cycle $\rightarrow \text{Remainder} = \mathbf{1}$.
Trick 5: Modular Arithmetic on Sums & Products
$(a + b) \bmod n = [(a \bmod n) + (b \bmod n)] \bmod n$
$(a \times b) \bmod n = [(a \bmod n) \times (b \bmod n)] \bmod n$
Worked Example: Find the remainder when $(253 \times 347)$ is divided by $9$.
$253 \bmod 9 \rightarrow 2 + 5 + 3 = 10 \rightarrow \mathbf{1}$
$347 \bmod 9 \rightarrow 3 + 4 + 7 = 14 \rightarrow \mathbf{5}$
Product remainder: $(1 \times 5) \bmod 9 = \mathbf{5}$.
Part 7: Factor Counting, Sum & Product of Factors
Let the prime factorization of a composite number $N$ be:
$$N = p^a \times q^b \times r^c$$
1. Total Number of Factors
$$\text{Total Factors} = (a + 1)(b + 1)(c + 1)$$
Example 1 ($360$): $360 = 2^3 \times 3^2 \times 5^1 \rightarrow (3 + 1)(2 + 1)(1 + 1) = 4 \times 3 \times 2 = \mathbf{24\text{ factors}}$.
Example 2 ($1,260$): $1,260 = 2^2 \times 3^2 \times 5^1 \times 7^1 \rightarrow (2 + 1)(2 + 1)(1 + 1)(1 + 1) = \mathbf{36\text{ factors}}$.
2. Odd Factors & Even Factors
Odd Factors: Ignore the power of $2$ completely and multiply $(b + 1)(c + 1)\dots$
Odd factors of $360$ ($2^3 \times 3^2 \times 5^1$) $= (2 + 1)(1 + 1) = \mathbf{6}$.
Even Factors: $\text{Total Factors} - \text{Odd Factors}$
Even factors of $360 = 24 - 6 = \mathbf{18}$.
3. Sum of All Factors
$$\text{Sum of Factors} = \left(\frac{p^{a+1} - 1}{p - 1}\right) \times \left(\frac{q^{b+1} - 1}{q - 1}\right) \times \dots$$
Example ($12 = 2^2 \times 3^1$):
$\text{Sum} = \left(\frac{2^3 - 1}{2 - 1}\right) \times \left(\frac{3^2 - 1}{3 - 1}\right) = 7 \times 4 = \mathbf{28}$ (Check: $1 + 2 + 3 + 4 + 6 + 12 = 28$).
4. Product of All Factors (SSC CGL Tier 2 Favorite)
$$\text{Product of All Factors} = N^{\left(\frac{\text{Total Factors}}{2}\right)}$$
Example ($12$, which has $6$ factors): $\text{Product} = 12^{6/2} = 12^3 = \mathbf{1,728}$.
Part 8: Consecutive Number Properties
Summation Identities
Sum of first $n$ natural numbers: $\frac{n(n + 1)}{2}$
Sum of $1$ to $50 = \frac{50 \times 51}{2} = \mathbf{1,275}$.
Sum of first $n$ even natural numbers: $n(n + 1)$
Sum of first $15$ even numbers $= 15 \times 16 = \mathbf{240}$.
Sum of first $n$ odd natural numbers: $n^2$
Sum of first $20$ odd numbers $= 20^2 = \mathbf{400}$.
High-Yield Exam Identities
Factorial Divisibility: The product of any $n$ consecutive integers is always divisible by $n!$.
Product of any $3$ consecutive integers is always divisible by $3! = \mathbf{6}$.
Product of any $4$ consecutive integers is always divisible by $4! = \mathbf{24}$.
Square of Any Odd Number Modulo $8$: The square of any odd integer always leaves a remainder of $1$ when divided by $8$ (since $(2k+1)^2 = 4k(k+1) + 1$, and $k(k+1)$ is always even).
$7^2 = 49 \rightarrow 49 \bmod 8 = \mathbf{1}$ | $11^2 = 121 \rightarrow 121 \bmod 8 = \mathbf{1}$.
Goldbach Partition Property: Every even integer greater than $2$ can be expressed as the sum of two prime numbers ($8 = 3 + 5$, $20 = 3 + 17$, $28 = 5 + 23$).
Quick Reference Summary Table
Problem Type | Fastest Exam Method / Formula |
|---|---|
Divisibility by $72$ / $88$ | Check co-prime pairs: $(8 \text{ \& } 9)$ for $72$; $(8 \text{ \& } 11)$ for $88$ |
HCF of large 3-digit numbers | Euclidean division algorithm |
HCF of close numbers | Subtraction / difference method |
LCM of two numbers | $(a \times b) \div \text{HCF}(a, b)$ |
Largest divisor (same remainder) | $\text{HCF of pairwise differences}$ |
Largest divisor (different remainders) | $\text{HCF of } (\text{Number} - \text{Remainder})$ |
Smallest dividend (same remainder $r$) | $\text{LCM of divisors} + r$ |
Unit digit of $a^n$ | Cyclicity period ($1, 2,$ or $4$); if $n \bmod \text{period} = 0$, take last digit |
Remainder $\div 9$ | Digital root (sum of digits reduced to a single digit) |
Remainder $\div 11$ | Alternating digit sum (right-to-left: odd positions $-$ even positions) |
Total factors of $p^a \cdot q^b \cdot r^c$ | $(a + 1)(b + 1)(c + 1)$ |
Product of all factors of $N$ | $N^{(\text{Total Factors} \div 2)}$ |
Sum of first $n$ odd numbers | $n^2$ |