Base | Representation |
---|---|
bin | 1001100011100010011101… |
… | …1001111011100101101011 |
3 | 1101012101012201211222201020 |
4 | 2120320213121323211223 |
5 | 2334113044141140430 |
6 | 34202243104023523 |
7 | 2133021135005115 |
oct | 230704731734553 |
9 | 41171181758636 |
10 | 10506151115115 |
11 | 33906a7456327 |
12 | 12181b4901ba3 |
13 | 5b2958771686 |
14 | 28470125a3b5 |
15 | 133450aadb10 |
hex | 98e2767b96b |
10506151115115 has 64 divisors (see below), whose sum is σ = 17420567270400. Its totient is φ = 5400402061824.
The previous prime is 10506151115107. The next prime is 10506151115177. The reversal of 10506151115115 is 51151115160501.
It is not a de Polignac number, because 10506151115115 - 23 = 10506151115107 is a prime.
It is a super-2 number, since 2×105061511151152 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1161794784 + ... + 1161803826.
It is an arithmetic number, because the mean of its divisors is an integer number (272196363600).
Almost surely, 210506151115115 is an apocalyptic number.
10506151115115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10506151115115 is a deficient number, since it is larger than the sum of its proper divisors (6914416155285).
10506151115115 is a wasteful number, since it uses less digits than its factorization.
10506151115115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13556.
The product of its (nonzero) digits is 3750, while the sum is 33.
Adding to 10506151115115 its reverse (51151115160501), we get a palindrome (61657266275616).
The spelling of 10506151115115 in words is "ten trillion, five hundred six billion, one hundred fifty-one million, one hundred fifteen thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •