How many binary strings of length 10 are palindromes?

**
Details and assumptions
**

A
**
palindrome
**
is a number that reads the same forward as it does backward.

A
**
binary string
**
is a sequence of integers that are
$1$
or
$0$
. The
**
length
**
of a string refers to the number of integers in it.

As an explicit example, the binary string of length $3$ are $000, 001, 010, 011$ , $100, 101, 110, 111$ .

The answer is 32.

**
This section requires Javascript.
**

You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.

No explanations have been posted yet. Check back later!