Can you identify the famous TV character from the rebus below?

In case you were starting to feel confident, this one was meant for third graders in Vietnam. The answer is 66, but we don't blame you for scratching your head about how they got there.

Why Wine Glass Stem is so long?

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 ?

Replace the 'X' with any mathematical symbol to make the expression equal to 111.

18 X 12 X 2 X 3 = 111

Different lights make me strange by changing me into different sizes. What am I?

A famous swimmer can swim downstream in a lake in exactly 40 minutes with the lake current.
He can swim upstream in that lake in exactly 60 minutes against the lake current.
The length of the lake is 2 km.

How long he can cover the distance of one side at a still lake with no current?

In a Society, there are over 100 flats.

Flat 1 is named the first flat.
Flat 2 is named the second flat.
Flat 3 is named the third flat. And So On.....

A visitor decides to walk through all the flats, and he finds all the flats except flat 62.
Anmol later founds that the locals of the town have given it another name.

What is the name of the Flat?

A high school has a strange principal. On the first day, he has his students perform an odd opening day ceremony:

There are one thousand lockers and one thousand students in the school. The principal asks the first student to go to every locker and open it. Then he has the second student go to every second locker and close it. The third goes to every third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth student does this to every fourth locker, and so on. After the process is completed with the thousandth student, how many lockers are open?

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?