Base | Representation |
---|---|
bin | 10110111110000011001010… |
… | …000101000000011100101110 |
3 | 111020200111220122200002111112 |
4 | 112332003022011000130232 |
5 | 101220112022401041420 |
6 | 554504225540352022 |
7 | 30164346035326361 |
oct | 2676031205003456 |
9 | 436614818602445 |
10 | 101021021112110 |
11 | 2a2088578947a0 |
12 | b3b66736a5612 |
13 | 444a31a508c58 |
14 | 1ad362cdc60d8 |
15 | ba2bc67538c5 |
hex | 5be0ca14072e |
101021021112110 has 32 divisors (see below), whose sum is σ = 198468083617632. Its totient is φ = 36716484718080.
The previous prime is 101021021112059. The next prime is 101021021112161. The reversal of 101021021112110 is 11211120120101.
It is an interprime number because it is at equal distance from previous prime (101021021112059) and next prime (101021021112161).
It is a super-3 number, since 3×1010210211121103 (a number of 43 digits) contains 333 as substring.
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, 230180399 + ... + 230618858.
It is an arithmetic number, because the mean of its divisors is an integer number (6202127613051).
Almost surely, 2101021021112110 is an apocalyptic number.
101021021112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101021021112110 is a deficient number, since it is larger than the sum of its proper divisors (97447062505522).
101021021112110 is a wasteful number, since it uses less digits than its factorization.
101021021112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460801268.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101021021112110 its reverse (11211120120101), we get a palindrome (112232141232211).
The spelling of 101021021112110 in words is "one hundred one trillion, twenty-one billion, twenty-one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •