Find The Number

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 ?




Similar Logic Riddles

Can you solve the below tricky visual equation?

Visual Equation

Asked by Neha on 29 Jun 2024


Transform the word THINK into BRAIN while changing only one letter at a time in a manner that each of the word in the process is a real word!!!

Asked by Neha on 16 Feb 2023

Open a Laptop which is password protected. Hint for the password is given as below:

1 mobile 3 books 2 Boards 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches

Asked by Neha on 06 Apr 2022


Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

Asked by Neha on 16 Jan 2026

A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?

Asked by Neha on 22 Apr 2022

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

Asked by Neha on 05 May 2024


There is a barrel with no lid and some wine in it. 'This barrel of wine is more than half full,' said Curly. 'No it's not,' says Mo. 'It's less than half full.' Without any measuring implements and without removing any wine from the barrel, how can they easily determine who is correct?

Asked by Neha on 05 May 2023

A man is shown a portrait painting. He looks closely, then tells, “Brothers and sisters have I none, but that man’s father is my father’s son!” Who is the man in the portrait?

Asked by Neha on 18 Jun 2025

A Man gave one of his sons 10 cents and another son was given 15 cents. What time is it?
Hint: Figure out the relation between time and number, is not so easy..:)

Asked by Neha on 02 Nov 2023


The host of a game show offers the guest a choice of three doors. Behind one is an expensive car, but behind the other two are goats.
After you have chosen one door, he reveals one of the other two doors behind which is a goat (he wouldn't reveal a car).

Now he gives you the chance to switch to the other unrevealed door or stay at your initial choice. You will then get what is behind that door.

You cannot hear the goats from behind the doors, or in any way know which door has the prize.

Should you stay, or switch, or doesn't it matter?

Asked by Neha on 06 May 2023

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki