<section id="description">
<p>The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.</p>
<p>Find the sum of all numbers, less than n, whereas 1000 &#x3C;= n &#x3C;= 1000000, which are palindromic in base 10 and base 2.</p>
<p>(Please note that the palindromic number, in either base, may not include leading zeros.)</p></section>

function doubleBasePalindromes(n) {
  // Good luck!
  return n;
}

doubleBasePalindromes(1000000);


index

Задача 36: Палиндромы с двойной базой

Problem 36: Double-base palindromes

<code>doubleBasePalindromes(1000)</code> should return 1772.

<code>doubleBasePalindromes(50000)</code> should return 105795.

<code>doubleBasePalindromes(500000)</code> should return 286602.

<code>doubleBasePalindromes(1000000)</code> should return 872187.