In a 3-digit number N, the digits are non-zero and distinct such that none of the digits is a perfect square, and only one of the digits is a prime number. Then, the number of factors of the minimum possible value of N is
You can find all the CAT Number System questions from the previous papers with detailed video explanations on this page. The number system plays a crucial role in CAT quantitative section. There are many tricks, shortcuts and formulas that help you to solve the questions quickly. One can find those solving tips in the video solutions explained by CAT experts and IIM Alumni. Look no further to get resources for practising the CAT Number systems concept. Take free CAT mocks to understand the exam pattern and also you'll get a fair idea of how questions are asked. Download the CAT number systems questions PDF with detailed video solutions and practice to perform well in the quant section. And the best part is you can download the questions PDF for free without signing up. Click on the link below to download all the number system questions from CAT previous papers PDF.
CAT Number Systems Questions Weightage
Year | Weightage |
| 2025 | 6 |
| 2024 | 8 |
| 2023 | 7 |
2022 | 4 |
2021 | 2 |
2020 | 9 |
2019 | 5 |
2018 | 4 |
CAT Number Systems Formulas PDF
CAT Number Systems is one of the important topics in the quantitative
aptitude section and it is vital to have a clear understanding of the
formulas related to them. Checking with the CAT exam syllabus will help you know similar other important topics. Also, enrolling in a CAT online coaching will help you maximize your preparation and save up time. To help the aspirants ace this topic, we have
made a PDF containing a comprehensive list of formulas, tips, and
tricks that you can use to solve number systems questions with ease
and speed. Click on the below link to download the CAT Number Systems formulas PDF.
1. Remainder Theorems Formulae
Fermat's Theorem - For any integer $$a$$ and prime number $$p$$, $$a^p-a$$ is always divisible by $$p$$
Wilson's Theorem - For a prime $$p$$, remainder when $$(p-1)!$$ i divided by $$p$$ is $$(p-1)$$
Euler's Theorem - If M and N are co-prime to each other then the remainder when $$M^{\phi(N)}$$ is divided by N is 1
2. HCF and LCM
HCF * LCM of two numbers = Product of two numbers
The greatest number dividing a, b and c leaving remainders of $$x_1$$, $$x_2$$ and $$x_3$$ is the HCF of (a-$$x_1$$), (b-$$x_2$$) and (c-$$x_3$$).
The greatest number dividing a, b and c (a<b<c) leaving the same remainder each time is the HCF of (c-b), (c-a), (b-a).
LCM of fractions = LCM of Numerators ÷ HCF of Denominators.
3. Number of trailing zeros
Number of trailing zeros of n! in base b(b=$$p^m$$, where p is a prime number) is for $$k\ge1$$ $$\frac{1}{m}\left(\Sigma\left[\frac{n}{p^k}\right]\ \right)$$