Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …111000000111111100111011 |
3 | 111020200102022021011021010002 |
4 | 112332002031320013330323 |
5 | 101220102440320231021 |
6 | 554503541420343215 |
7 | 30164312022354461 |
oct | 2676021570077473 |
9 | 436612267137102 |
10 | 101020011102011 |
11 | 2a208389754201 |
12 | b3b64313a4b0b |
13 | 444a1b91a5741 |
14 | 1ad3574bd0831 |
15 | ba2b67c4650b |
hex | 5be08de07f3b |
101020011102011 has 8 divisors (see below), whose sum is σ = 101992867677360. Its totient is φ = 100047992117472.
The previous prime is 101020011102007. The next prime is 101020011102079. The reversal of 101020011102011 is 110201110020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101020011102011 - 22 = 101020011102007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020011101983 and 101020011102001.
It is not an unprimeable number, because it can be changed into a prime (101020011108011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209155325 + ... + 209637758.
It is an arithmetic number, because the mean of its divisors is an integer number (12749108459670).
Almost surely, 2101020011102011 is an apocalyptic number.
101020011102011 is a deficient number, since it is larger than the sum of its proper divisors (972856575349).
101020011102011 is a wasteful number, since it uses less digits than its factorization.
101020011102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418795405.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101020011102011 its reverse (110201110020101), we get a palindrome (211221121122112).
The spelling of 101020011102011 in words is "one hundred one trillion, twenty billion, eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •