es
ss
l a
e C
il n
QA Numbers O n - 3
Numbers - Trailing Digits,
Divisibility, Remainders
es
1. The unit digit of the final solution for 13 × 27 × 63 × 51 × 98 × 46 is
(1) 4
ss
(2) 8
(3) 2
l a
(4) None of the above
e C
il n
O n
es
2. What is the units digit of 1781 + 2781 + 3781 + … + 9781?
(1) 5
ss
(2) 3
(3) 1
l a
(4) 7
(5) 8
e C
il n
O n
es
3. What are the last two digits of 7(4004)?
(1) 21
ss(CAT)
(2) 61
(3) 01
l a
(4) 41
(5) 81
e C
il n
O n
es
4. Find the digit in the units place in the product 254 × 361 × 159 × 18.
(1) 1
ss
(2) 6
(3) 4
l a
(4) 8
e C
il n
O n
es
5.
79
What is the last digit of the number 35 1?
ss
(1) 1
(2) 7
l a
C
(3) 4
(4) 3
e
il n
O n
es
6.
45 54
What will be the last digit of 23 23 ?
ss
(1) 0
(2) 2
l a
C
(3) 4
(4) 6
e
il n
O n
es
7.
s
Zahir and Raman are at the entrance of a dark cave. To enter this cave, they need to open a number lock. Raman
s
sees a note on a rock: “... chest of pure diamonds kept for the smart one ... number has six digits ... second last
a
digit is 2, third last is 4 ... divisible by all prime numbers less than 15 ...”. Excited, Zahir and Raman seek your help:
l
which of these can be the first digit of the six-digit number that will help them open the lock?
(XAT)
(1) 9
(2) 4
e C
il n
(3) 3
(4) 1
(5) 5
O n
es
8. Find the unit’s place digit of (1!)1! + (2!)2! + (3!)3! + … + (100!)100! .
(1) 1
ss
(2) 7
(3) 0
l a
(4) 6
e C
il n
O n
es
9. A number G236G0 can be divided by 36 if G is:
(1) 8
ss
(2) 6
(3) 1
l a
(4) More than one values are possible.
e C
il n
O n
es
10. Which one of the following numbers will completely divide (461 + 462 + 463 + 464)?
(1) 3
ss
(2) 10
(3) 11
l a
(4) 13
e C
il n
O n
es
a + b + c is
ss
11. If a, b and c are positive integers such that ab = 432, bc = 96 and c < 9, then the smallest possible value of
(CAT)
(1) 46
(2) 56
l a
C
(3) 49
(4) 59
e
il n
O n
es
12. How many pairs (m, n) of positive integers satisfy the equation m2 + 105 = n2?
ss(CAT)
l a
e C
il n
O n
es
13. What is the largest positive integer n such that
n2 7n 12
n2 n 12
is also a positive integer?
ss
l a (CAT)
(1) 16
(2) 12
e C
il n
(3) 6
(4) 8
O n
es
divided by 29.
ss
14. A certain number, when divided by 899, leaves a remainder 64. Find the remainder when the same number is
l a (CAT)
C
(1) 6
(2) 5
(3) 1
e
il n
(4) Cannot be determined
O n
es
Find the remainder when (x2 + y2) is divided by 6.
ss
15. Two numbers, x and y, are such that when divided by 6, they leave remainders 4 and 5 respectively.
(1) 2
(2) 3
l a
C
(3) 4
(4) 5
(5) None of these
e
il n
O n
es
16. The remainder, when (4523 + 5023) is divided by 19, is
ss(CAT)
l a
e C
il n
O n
es
17. What is the remainder when (143 + 153 + 163 + 173) is divided by 62?
(1) 0
ss(CAT)
(2) 1
(3) 32
l a
(4) 59
e C
il n
O n
es
18. 76n – 66n, where n is an integer greater than 0, is not divisible by
(1) 13
ss(CAT)
(2) 81
(3) 127
l a
(4) 559
e C
il n
O n
es
19. What is the remainder when (7413 – 4113 + 7513 – 4213) is divided by 66?
(1) 2
ss
(2) 64
(3) 1
l a
(4) 65
(5) 0
e C
il n
O n
es
20. The remainder when 42001 is divided by 6 is?
ss(CAT)
l a
e C
il n
O n
es
21. The sum of all two digit numbers that give a remainder 2 when they are divided by 7 is _________ .
(1) 552
ss
(2) 654
(3) 658
l a
(4) 684
e C
il n
O n
es
if the number is successively divided by 3 and 4?
ss
22. A number when successively divided by 5 and 6 gives remainders 3 and 2 respectively. What will be the remainders
(1) 2, 3
(2) 2, 1
l a
C
(3) 1, 2
(4) 3, 4
e
il n
O n
es
ss
23. Find the least positive number which when divided by 2 leaves a remainder of 1, when divided by 3 leaves a
remainder of 2, when divided by 4 leaves a remainder of 3 and when divided by 5 leaves a remainder of 4.
(1) 33
(2) 59
l a
C
(3) 61
(4) 49
e
il n
O n
es
What will be the remainder when the number is divided by 8?
ss
24. When a number is divided by 4, then the remainder is 2. When the quotient is divided by 2, then the remainder is 1.
(1) 4
(2) 5
l a
C
(3) 6
(4) 7
e
il n
O n
es
25. How many factors of 24 × 35 × 104 are perfect squares which are greater than 1?
ss(CAT)
l a
e C
il n
O n
es
ss
l a
e C
il n
Thanks!
O n
