CAT Number System: The Complete Guide (Free 6-Hour Marathon Included)
The Definitive Guide to Number System for CAT 2026 (Free 6-Hour Video Included)
Last updated: August 26, 2026.
Number System is one of those CAT topics every aspirant knows matters, and almost nobody prepares completely. Most guides cover divisibility rules, HCF-LCM, and basic remainders, then stop. The questions that actually separate a good Quant score from a 99-percentile one usually come from the parts everyone skips, cyclicity, advanced remainder theorems, and number base systems.
This guide covers the complete syllabus, and includes a free 6-hour recorded session where every one of these topics is taught from scratch, with CAT-level questions solved live.
Why Number System Still Matters
Number System questions have genuinely declined in raw count over recent CAT papers, most analyses put it at 2-4 direct questions. But treating it as low-priority because of that count misses the real reason it matters. Number System concepts, divisibility, remainders, factorisation, quietly power a meaningful share of Arithmetic and Algebra questions too. A shaky foundation here doesn't just cost you 2-4 marks, it slows you down everywhere the underlying logic resurfaces.
What This Guide Covers
- Types of Numbers and Basic Classification
- Divisibility Rules and Fast Tricks
- Factors and Multiples
- HCF and LCM
- Remainders, Basic to Advanced
- Cyclicity of Unit Digits, Last Two Digits, and Remainders
- Fermat's Little Theorem, Euler's Totient Function, Wilson's Theorem, and the Chinese Remainder Theorem
- Trailing Zeroes in Factorials
- Indices, Powers, and Number Base Systems
Types of Numbers
Before divisibility and remainders make sense, it's worth being precise about the vocabulary. Natural numbers, integers, rational and irrational numbers, prime and composite numbers, co-prime pairs, perfect squares and cubes, these classifications aren't just definitions, CAT questions frequently hinge on which category a number belongs to. A question asking for the "smallest positive integer" behaves very differently from one asking for the "smallest natural number," and confusing the two costs marks on questions that were otherwise straightforward.
Divisibility Rules and Fast Tricks
Standard divisibility rules for 2 through 11 are table stakes, most aspirants know these by the time they start CAT prep seriously. The real time-saving comes from faster methods for the trickier divisors, particularly 7, where the Osculator Method turns a slow, error-prone check into a quick mental calculation. Beyond the standard rules, it's worth getting comfortable with digit-pattern-based divisibility shortcuts and how divisibility interacts with expressions like $49^{15} - 1$, exactly the kind of question that looks intimidating until you recognise the underlying pattern.
Factors and Multiples
Confusing factors with multiples is a surprisingly common early mistake. Beyond the basic distinction, the real CAT-level skill is counting factors efficiently through prime factorisation, and working backwards, given that a number has exactly 8 factors, what could that number actually be. These "reverse" factor questions show up regularly and reward comfort with the underlying prime factorisation logic rather than memorised shortcuts.
HCF and LCM
HCF and LCM are frequently treated as a solved, formulaic topic, and the basics genuinely are simple. What trips people up is application, word problems that disguise an HCF or LCM question as a scheduling, packaging, or measurement scenario, and mixed questions where number system logic and HCF-LCM reasoning combine in the same problem. HCF and LCM also quietly underpin a meaningful share of Arithmetic questions, particularly Time & Work and TSD problems involving repeating cycles.
Remainders, From Basic to Advanced
Remainder questions escalate quickly in difficulty. Basic remainder application gets you through the easier questions, but CAT likes to test negative remainders, situations where thinking in terms of "how far below the next multiple" is faster than the standard approach, and combined LCM-plus-remainder problems, where you're given a number's remainder behaviour across multiple divisors and asked to reconstruct constraints on the number itself. Classic problem types here, the "gold coins" style question that shows up in some form almost every year, and techniques for finding the minimum value of n that satisfies multiple remainder conditions simultaneously, are worth mastering as a set rather than in isolation.
Cyclicity, Unit Digits, and Last Two Digits
Cyclicity questions ask what the last digit, or last two digits, of a large power will be, and they're genuinely fast once you know the pattern, and genuinely slow if you try to compute directly. Unit digit cyclicity follows a repeating pattern based on the base's last digit, worth memorising as a full cyclicity table so you can read it instantly under time pressure. Last-two-digit questions are a step harder, powers ending in 5 and the well-known "76 pattern" (any power of a number ending in 76, when raised further, still ends in 76) are specific, memorisable patterns worth knowing cold rather than deriving under exam pressure.
The Advanced Theorems: Fermat, Euler, Wilson, and CRT
This is where most CAT prep content stops, and where genuinely comprehensive preparation goes further than almost anything else publicly available for CAT specifically.
Fermat's Little Theorem gives a fast way to find remainders when a prime number is involved, collapsing what would otherwise be a huge calculation into a simple modular reduction.
Euler's Totient Function extends similar remainder logic to non-prime moduli, genuinely useful for a specific, recurring style of CAT remainder question once you recognise the setup.
Wilson's Theorem deals with factorial-based remainder questions involving primes, a niche but real CAT pattern that almost no freely available CAT content actually teaches with worked examples.
The Chinese Remainder Theorem ties multiple remainder conditions together into one combined answer, the natural extension of the "different remainders across different divisors" problems covered in the Remainders section above.
Trailing Zeroes in Factorials
A specific, frequently searched CAT Number System question type, how many zeroes does a number like 100! end in? The technique relies on counting the highest power of 5 dividing into the factorial (5s are the limiting factor, since factors of 2 are always more abundant), the same "highest power of a prime in a factorial" logic used more broadly in Indices & Powers questions, applied specifically to this question format.
Indices, Powers, and Number Base Systems
Exponent-based questions round out the syllabus, finding the greatest power of a number that divides a given expression, and number base systems, converting between bases and applying arithmetic operations outside the familiar base-10 system. Base system questions are infrequent but predictable once you understand the underlying place-value logic, a small, learnable topic that's easy to secure full marks on when it does appear.
Watch the Complete Session
Every topic above is taught from scratch and solved through real CAT-level questions across this free 6-hour session, timestamped so you can jump directly to whatever you need to revise.