UPSC CSAT Numeracy – Chapter 3: Divisibility, Remainders and Unit Digits (48 MCQs)
UPSC CSAT Numeracy – Chapter 3: Divisibility, Remainders and Unit Digits (48 MCQs) – 48 questions, subject: CSAT Numeracy. Every question has the correct answer with a two-line explanation; tap "Show Answer". Free practice for TNPSC, UPSC, SSC, Bank and RRB exams – Shanmugam IAS Academy, Coimbatore.
Link to this page from your website / blog (HTML code)
Correct Answer: A [7 × 11 × 13]
Explanation:
7 × 11 = 77 and 77 × 13 = 1001, so 1001 = 7 × 11 × 13. This is why any six-digit number of the form XYZXYZ (= XYZ × 1001) is divisible by 7, 11 and 13.
Correct Answer: C [its digit sum is divisible by 9]
Explanation:
Since 10 leaves remainder 1 on division by 9, every number leaves the same remainder as its digit sum, so it is divisible by 9 when its digit sum is. For example, 7,452 has digit sum 18 and equals 9 × 828; equal alternate-digit sums is the test for 11.
Correct Answer: B [6]
Explanation:
2⁵⁰ × 3⁵⁰ = (2 × 3)⁵⁰ = 6⁵⁰, and every power of 6 ends in 6. Separately, 2⁵⁰ ends in 4 and 3⁵⁰ ends in 9, and 4 × 9 = 36 also ends in 6.
Correct Answer: D [0, 1, 5, 6]
Explanation:
0 × 0, 1 × 1, 5 × 5 and 6 × 6 end in 0, 1, 5 and 6 again, so every power of a number ending in these digits keeps the same last digit. Digits such as 2, 3, 7 and 8 change in cycles of four.
Correct Answer: A [24]
Explanation:
Trailing zeros in n! equal the number of factors of 5: ⌊100/5⌋ + ⌊100/25⌋ = 20 + 4. So 100! ends with 24 zeros.
Correct Answer: B [N − r]
Explanation:
By the division rule N = qd + r, so N − r = qd is an exact multiple of d. For example, 47 = 5 × 9 + 2, and 47 − 2 = 45 is divisible by 5.
Correct Answer: C [4 and 6]
Explanation:
4¹ = 4 and 4² = 16 ends in 6, and then 6 × 4 = 24 ends in 4 again, so powers of 4 end alternately in 4 and 6. Odd powers end in 4 and even powers end in 6.
Correct Answer: B [3]
Explanation:
10⁶ leaves remainder 1 on division by 13 (999,999 = 13 × 76,923), and 64 = 6 × 10 + 4, so 10⁶⁴ leaves the same remainder as 10⁴. Since 10,000 = 13 × 769 + 3, the remainder is 3.
Correct Answer: D [greater than 31]
Explanation:
A remainder is always smaller than the divisor, so a divisor that leaves remainder 31 must be greater than 31 (at least 32). It need not be prime or odd; for example, 63 ÷ 32 leaves 31.
Correct Answer: B [1 and 3 only]
Explanation:
Statement 1 is true since 123,123 = 123 × 1001 = 123 × 7 × 11 × 13, and Statement 3 is true since 10⁶ − 1 = 999,999 = 7 × 142,857. Statement 2 is false: 21 has digit sum 3 but is odd, so it is not divisible by 6.
Correct Answer: A [Both A and R are true, and R is the correct explanation of A]
Explanation:
Each trailing zero needs one factor 10 = 2 × 5, and n! always has more factors of 2 than of 5, so the number of 5s decides the zeros. Thus both statements are true and R correctly explains A (e.g. 10! has two 5s and two zeros).
Correct Answer: C [4]
Explanation:
Using cycles of four, 3⁶⁵ ends in 3 (65 leaves 1), 6⁵⁹ always ends in 6, and 7⁷¹ ends in 3 (71 leaves 3; cycle 7, 9, 3, 1). The product of the unit digits is 3 × 6 × 3 = 54, so the unit digit is 4.
Correct Answer: A [1]
Explanation:
7 = 6 + 1, so 7 leaves remainder 1 on division by 6, and every power of 7 also leaves 1 × 1 × … = 1. A remainder on division by 6 can never be 7, and 7⁸⁵ is not a multiple of 6.
Correct Answer: C [8]
Explanation:
The digit sum of 8,452 is 19, which leaves remainder 1 on division by 9, so 9 − 1 = 8 must be added. Check: 8,460 has digit sum 18, a multiple of 9.
Correct Answer: B [11]
Explanation:
13 × 76 = 988, which is the largest multiple of 13 not exceeding 999. So the remainder is 999 − 988 = 11.
Correct Answer: D [3-1-2-4]
Explanation:
On division by 7 the remainders are 29 → 1, 100 → 2, 45 → 3 and 41 → 6. Arranged in increasing order of remainder this is 3-1-2-4.
Correct Answer: C [5,291]
Explanation:
For 5,291 the difference of alternate digit sums is (5 + 9) − (2 + 1) = 11, a multiple of 11, so 5,291 = 11 × 481. For 3,471, 4,812 and 6,152 this difference is 5, 5 and 8, so they are not divisible by 11.
Correct Answer: A [1]
Explanation:
7² = 49 ends in 9, and 9 × 9 = 81 ends in 1, so 7⁴ = 2401 ends in 1. Powers of 7 end in the cycle 7, 9, 3, 1, so every 4th power ends in 1.
Correct Answer: B [4]
Explanation:
On division by 5, 17, 23 and 29 leave remainders 2, 3 and 4, and 2 × 3 × 4 = 24 leaves remainder 4. Check: 17 × 23 × 29 = 11339, which ends in 9 and so leaves 4.
Correct Answer: A [2]
Explanation:
2³ = 8 leaves remainder 1 on division by 7, so 2¹⁰ = (2³)³ × 2 leaves 1 × 2 = 2. Check: 2¹⁰ = 1024 = 7 × 146 + 2.
Correct Answer: C [3]
Explanation:
Leaving remainder 1 means the divisor divides 420 and 426, and so divides their HCF 6. The divisor must also be greater than the remainder 1, so only 2, 3 and 6 work, giving 3 numbers.
Correct Answer: A [0]
Explanation:
85 = 5 × 17 and 95 = 5 × 19 give 5², and 96 = 4 × 24 gives 2², so the product contains 25 × 4 = 100. Hence it is exactly divisible by 100 and the remainder is 0.
Correct Answer: D [7, 11 and 13]
Explanation:
XYZXYZ = XYZ × 1,001, and 1,001 = 7 × 11 × 13. So every such number is divisible by 7, 11 and 13 at the same time.
Correct Answer: C [12]
Explanation:
7x + 96 is divisible by x exactly when x divides 96, since x always divides 7x. 96 = 2⁵ × 3 has (5 + 1)(1 + 1) = 12 divisors, so there are 12 possible values of x.
Correct Answer: A [11]
Explanation:
999999 (six 9s) = 10⁶ − 1 is divisible by 13, so blocks of six 9s leave no remainder. 99 = 6 × 16 + 3, so the remainder equals that of 999 ÷ 13, which is 999 − 988 = 11.
Correct Answer: D [9]
Explanation:
The divisors must divide 1,186 − 31 = 1,155 = 3 × 5 × 7 × 11 and must be greater than the remainder 31. The divisors of 1,155 above 31 are 33, 35, 55, 77, 105, 165, 231, 385 and 1,155, which makes 9 numbers.
Correct Answer: D [0]
Explanation:
1261 = 13 × 97, and the product contains 91 = 7 × 13 and also 97 itself. So 13 × 97 divides the product exactly and the remainder is 0.
Correct Answer: B [6]
Explanation:
In 15!, the multiples of 3 are 3, 6, 9, 12 and 15, and 9 = 3² gives an extra factor, so the power of 3 is 5 + 1 = 6. By the formula, [15/3] + [15/9] = 5 + 1 = 6.
Correct Answer: B [6]
Explanation:
Since 1001 = 7 × 11 × 13, a number is divisible by 7 if the alternating sum of its three-digit blocks from the right is: 369 − 25P + 981 − 37 = 1313 − 25P. Only P = 6 works, giving 1313 − 256 = 1057 = 7 × 151.
Correct Answer: A [10]
Explanation:
Trailing zeros come from pairs of 2 and 5; the product has fourteen 5s (25 and 50 give two each) but only ten 2s (from 10, 20, 30, 40, 50, 60 = 1 + 2 + 1 + 3 + 1 + 2). The 2s are fewer, so there are 10 zeros, not 14.
Correct Answer: A [50]
Explanation:
The product contains 35 × 62 × 75 = 1,62,750, which ends in 50; multiplying a number ending in 50 by any odd number keeps it ending in 50. Since 27 and 51 are odd, the full product ends in 50, so the remainder on dividing by 100 is 50.
Correct Answer: D [8]
Explanation:
In 5B7 + 136, the units give 13 (write 3, carry 1), and the hundreds 5 + 1 = 7 need a carry from the tens, so B + 4 = A + 10, i.e. A = B − 6. For 7A3 to be divisible by 3, 10 + A must be a multiple of 3, so A = 2 and B = 8 (587 + 136 = 723).
Correct Answer: C [4]
Explanation:
The digit sum of 4252746B is 30 + B, which must be a multiple of 3, so B can be 0, 3, 6 or 9. That gives 4 possible values of B.
Correct Answer: B [3 and 37 but not 2]
Explanation:
222333 + 333222 = 555555 = 555 × 1001 = 3 × 5 × 37 × 1001, so it is divisible by 3 and 37. It ends in 5 and is odd, so it is not divisible by 2.
Correct Answer: D [9]
Explanation:
30³⁰ = 3³⁰ × 10³⁰, so the last non-zero digit is the unit digit of 3³⁰; powers of 3 end in the cycle 3, 9, 7, 1. Since 30 leaves remainder 2 on division by 4, 3³⁰ ends in 9.
Correct Answer: D [200]
Explanation:
The product is k^(2k) for k = 1 to 25, and trailing zeros depend on the number of 5s (2s are more plentiful). The 5s come from 5¹⁰, 10²⁰, 15³⁰, 20⁴⁰ (10 + 20 + 30 + 40 = 100) and 25⁵⁰ = 5¹⁰⁰ (100 more), giving 200 zeros.
Correct Answer: C [10]
Explanation:
32⁵ = (2⁵)⁵ = 2²⁵, so 32⁵ + 2²⁷ = 2²⁵(1 + 2²) = 5 × 2²⁵. It contains both 2 and 5, so it is divisible by 10, but it has no factor 3, 7 or 11.
Correct Answer: C [7]
Explanation:
The last digits of powers of 3 repeat in the cycle 3, 9, 7, 1 (length 4). Since 2019 leaves remainder 3 when divided by 4, 3²⁰¹⁹ ends in 7, so the remainder on dividing by 10 is 7.
Correct Answer: A [2]
Explanation:
The unit digit depends only on 2 raised to the exponent 9 × 7 × 5 × 3 × 1 = 945; powers of 2 end in the cycle 2, 4, 8, 6. Since 945 leaves remainder 1 on division by 4, the unit digit is 2.
Correct Answer: D [4]
Explanation:
2¹⁹² is even, and since 2² = 4 ≡ 1 (mod 3), 2¹⁹² = 4⁹⁶ leaves remainder 1 on division by 3. The even number between 0 and 5 that leaves 1 on division by 3 is 4, so the remainder is 4.
Correct Answer: C [81]
Explanation:
111,111,111² = 12,345,678,987,654,321, whose digits rise from 1 to 9 and fall back to 1. Their sum is 2 × (1 + 2 + … + 8) + 9 = 72 + 9 = 81.
Correct Answer: D [15873]
Explanation:
The smallest number of ones divisible by 7 is 111111 (= 111 × 1001 = 111 × 7 × 11 × 13), and 111111 ÷ 7 = 15873. Smaller ones-numbers like 11111 are not divisible by 7, so 15873 is the smallest such number.
Correct Answer: C [5]
Explanation:
Every factor is odd, so the product is odd; and 5 is one of the factors, so the product is an odd multiple of 5. Every odd multiple of 5 ends in 5.
Correct Answer: C [22]
Explanation:
Divisibility by 9 adds nothing beyond 3. A number up to 100 that has no factor 2, 3, 5 or 7 must be 1 or a prime above 7 (a composite would need a prime factor of at most 10, since 11² = 121 > 100). There are 25 primes up to 100; leaving out 2, 3, 5, 7 gives 21, and with 1 the count is 22.
Correct Answer: B [4]
Explanation:
35ⁿ = 5ⁿ × 7ⁿ, so count both primes. Factors of 5: one in 385 and three in 1000 (2³ × 5³) – four. Factors of 7: 7 (1), 343 = 7³ (3), 385 (1), 2401 = 7⁴ (4), 77777 = 7 × 11111 (1) – ten. The scarcer prime, 5, limits n to 4.
Correct Answer: C [2]
Explanation:
For n = 1, 1 + 2 = 3 leaves remainder 3. For n ≥ 2, 2ⁿ is a multiple of 4, so 1 + 2ⁿ leaves 1. Two distinct remainders, 3 and 1.
Correct Answer: A [0]
Explanation:
Each power 9ᵏ is odd and a multiple of 3, so it leaves 3 on division by 6. From 9³ to 9¹⁰⁰ there are 98 terms, so the sum leaves the same remainder as 98 × 3 = 294 = 6 × 49 – that is, 0.
Correct Answer: C [There can be more than one such number.]
Explanation:
Call the numbers a and a + 10. If a is a multiple of 5, the only multiple of 5 between them is a + 5 (5 and 15 → 10); otherwise there are two (3 and 13 → 5 and 10). So the count is one or two: more than one is possible, though not certain. (Counting the end numbers too gives two or three – the conclusion is the same.)
➤ Class X level methods, shortcuts with proof, worked solutions to UPSC CSAT numeracy PYQs and a reason for every option – U25 · CSAT Numeracy (UPSC book, ₹249): www.shanmugamiasacademy.in/study-materials/upsc-csat-numeracy
Today Current Affairs in Tamil | 23 நவம்பர் 2026 | TNPSC Group 4 முக்கிய வினாக்கள்
📚 TNPSC குரூப் 4 / 2 / 2A – பொதுத்தமிழ், பொது அறிவு நூல்கள்
PDF நூல்கள் · ₹149 முதல் · ஒவ்வொன்றுக்கும் 50 பக்க இலவச மாதிரி · UPI-இல் பணம் செலுத்தியதும் உடனே பதிவிறக்கம்
பொதுத் தமிழ் — முழுமையான கையேடு (TNPSC குரூப் 2 · 2A · 4)
₹199
TNPSC முழுமையான பாடநூல்கள் – முழுத் தொகுப்பு (9 நூல்கள்)
₹1599
பொதுத் தமிழ் — முந்தைய ஆண்டு வினா – விடை – விளக்கம் (புதிய பாடத்திட்டம்)
₹199
TNPSC திறனறிவும் மனக்கணக்கு நுண்ணறிவும் (Aptitude & Mental Ability) – முழுமையான பாடநூல்
₹199TNPSC குரூப் 1, 2/2A, 4 – நேரடி வகுப்புகள் · கோவை & மதுரை
2006 முதல் சண்முகம் IAS அகாடமி · Classroom & online coaching in Coimbatore and Madurai
