Base | Representation |
---|---|
bin | 1011111010110111101010… |
… | …1101101001011010000111 |
3 | 1201101220212221202000010121 |
4 | 2332231322231221122013 |
5 | 3204212044011202120 |
6 | 43512452022202411 |
7 | 2521606665653206 |
oct | 276557255513207 |
9 | 51356787660117 |
10 | 13106004006535 |
11 | 41a3252652870 |
12 | 1578046283407 |
13 | 740b7733743b |
14 | 33449661923d |
15 | 17adb5a4b5aa |
hex | beb7ab69687 |
13106004006535 has 16 divisors (see below), whose sum is σ = 17323523043840. Its totient is φ = 9439099086240.
The previous prime is 13106004006527. The next prime is 13106004006649. The reversal of 13106004006535 is 53560040060131.
It is not a de Polignac number, because 13106004006535 - 23 = 13106004006527 is a prime.
It is a super-2 number, since 2×131060040065352 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13106004006535.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1156746675 + ... + 1156758004.
It is an arithmetic number, because the mean of its divisors is an integer number (1082720190240).
Almost surely, 213106004006535 is an apocalyptic number.
13106004006535 is a deficient number, since it is larger than the sum of its proper divisors (4217519037305).
13106004006535 is a wasteful number, since it uses less digits than its factorization.
13106004006535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2313504798.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 13106004006535 its reverse (53560040060131), we get a palindrome (66666044066666).
It can be divided in two parts, 1310600 and 4006535, that added together give a palindrome (5317135).
The spelling of 13106004006535 in words is "thirteen trillion, one hundred six billion, four million, six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •