Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …1000100000001110110110 |
3 | 1110022020122121202000210010 |
4 | 2201202213320200032312 |
5 | 2423334333044200042 |
6 | 35335422355241050 |
7 | 2224010266646625 |
oct | 241424770401666 |
9 | 43266577660703 |
10 | 11101012100022 |
11 | 359aa04a22809 |
12 | 12b354a5a9186 |
13 | 626a89819340 |
14 | 2a5412bb36bc |
15 | 143b696b559c |
hex | a18a7e203b6 |
11101012100022 has 128 divisors (see below), whose sum is σ = 27100451750400. Its totient is φ = 2993953867776.
The previous prime is 11101012099997. The next prime is 11101012100047. The reversal of 11101012100022 is 22000121010111.
It is an interprime number because it is at equal distance from previous prime (11101012099997) and next prime (11101012100047).
It is a junction number, because it is equal to n+sod(n) for n = 11101012099980 and 11101012100007.
It is a congruent number.
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, 2247633 + ... + 5220524.
It is an arithmetic number, because the mean of its divisors is an integer number (211722279300).
Almost surely, 211101012100022 is an apocalyptic number.
11101012100022 is an abundant number, since it is smaller than the sum of its proper divisors (15999439650378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101012100022 is a wasteful number, since it uses less digits than its factorization.
11101012100022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7468270.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11101012100022 its reverse (22000121010111), we get a palindrome (33101133110133).
It can be divided in two parts, 1110101 and 2100022, that added together give a palindrome (3210123).
The spelling of 11101012100022 in words is "eleven trillion, one hundred one billion, twelve million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •