I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

If 1+9+8=1, what is 2+8+9?

Which is the smallest number that you can write using all the vowels exactly once?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

One day Jenifer meets the Lion and the Tiger in the Forest of Forgetfulness. She knows that the Lion lies on Mondays, Tuesdays, and Wednesdays, and tells the truth on the other days of the week. The Tiger, on the other hand, lies on Thursdays, Fridays, and Saturdays, but tells the truth on the other days of the week. Now they make the following statements to Jenifer:

Lion: Yesterday was one of my lying days.

Tiger: Yesterday was one of my lying days too.

What day is it?

Next Number in the Series,

5, 16, 49, 104, ?

Accidentally, two trains are running in the opposite direction and enter a tunnel that is 200 miles long. A supersonic bird that has fled the lab and taken shelter in the tunnel starts flying from one train towards the other at a speed of 1000 mph. As soon as it reaches the second train, he starts flying back to avoid collision and meets the first train again at the other end. The bird keeps flying to and fro till the trains collide with each other.

What is the total distance that the supersonic bird has traveled till the trains collided?

You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?

ENEMY = 2 * LINK
LINK + 2 = HELL

Then what will be TAXI + HELL? Select from the options below:
a) ROTTEN
b) DANGER
c) HEAVEN
4) MORTAL