Base | Representation |
---|---|
bin | 1010001101000101110011… |
… | …0001101101011001010011 |
3 | 1110201121210212101011212211 |
4 | 2203101130301231121103 |
5 | 2432312040321041034 |
6 | 35510222453132551 |
7 | 2235422222604643 |
oct | 243213461553123 |
9 | 43647725334784 |
10 | 11220011112019 |
11 | 363641a849816 |
12 | 131261b02a157 |
13 | 63507250b8c8 |
14 | 2ab0a11d2523 |
15 | 146cd1841d64 |
hex | a345cc6d653 |
11220011112019 has 8 divisors (see below), whose sum is σ = 11285660393568. Its totient is φ = 11154449658240.
The previous prime is 11220011111977. The next prime is 11220011112043. The reversal of 11220011112019 is 91021111002211.
It is a happy number.
11220011112019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11220011112019 - 27 = 11220011111891 is a prime.
It is a super-2 number, since 2×112200111120192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11220011112119) 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, 21700687 + ... + 22211704.
It is an arithmetic number, because the mean of its divisors is an integer number (1410707549196).
Almost surely, 211220011112019 is an apocalyptic number.
11220011112019 is a deficient number, since it is larger than the sum of its proper divisors (65649281549).
11220011112019 is a wasteful number, since it uses less digits than its factorization.
11220011112019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43913885.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 11220011112019 in words is "eleven trillion, two hundred twenty billion, eleven million, one hundred twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •