# NSTSE (National Science Talent Search Exam- Unified Council) Class 4: Questions 632 - 638 of 1971

Access detailed explanations (illustrated with images and videos) to 1971 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

## Question number: 632

Edit
MCQ▾

### Question

Sum of the odd numbers between 5 and 12 is: (Model Test Paper)

### Choices

Choice (4) Response

a.

7

b.

16

c.

27

d.

17

## Question number: 633

Edit
MCQ▾

### Question

What is the difference between the least common multiple and highest common factor of the numbers 6 and 15?

### Choices

Choice (4) Response

a.

25

b.

30

c.

27

d.

31

## Question number: 634

Edit
MCQ▾

What is if

### Choices

Choice (4) Response

a.

32

b.

2

c.

4

d.

3

## Question number: 635

Edit
MCQ▾

### Question

Manali is arranging his father’s book in a new bookshelf which has 6 shelves. After putting 15 books in each shelf, she finds that 10 books are still left outside. How many books are there in total?

### Choices

Choice (4) Response

a.

75

b.

100

c.

108

d.

90

## Question number: 636

Edit
MCQ▾

### Question

The number 14 has four factors: . The table below lists the number of factors for some numbers.

 Number Number of factors 21 4 23 2 25 3 27 4 29 2

From this we can say that the number of composite numbers between 20 and 30 is:

### Choices

Choice (4) Response

a.

0

b.

3

c.

4

d.

2

## Question number: 637

Edit
MCQ▾

### Question

of 12 km ________m

### Choices

Choice (4) Response

a.

20

b.

200

c.

2000

d.

2

## Question number: 638

Edit
MCQ▾

### Question

Meera divided by 15 and obtained a quotient of 374 and remainder of 8. For this problem, which of these checks will help Meera to find her mistakes?

### Choices

Choice (4) Response

a.

Check if quotient divisor remainder dividend

b.

Check his calculations of and

c.

Check if remainder dividend

d.

Check if remainder divisor

Developed by: