Base | Representation |
---|---|
bin | 1001000110011001100111… |
… | …10100011000010011010111 |
3 | 2121212001012111110200221211 |
4 | 10203030303310120103113 |
5 | 10110330234213013421 |
6 | 110320552121122251 |
7 | 4133520154332043 |
oct | 443146364302327 |
9 | 77761174420854 |
10 | 20011122001111 |
11 | 641573a75409a |
12 | 22b2358329387 |
13 | b2206b586097 |
14 | 4d2787409023 |
15 | 24a8064c39e1 |
hex | 123333d184d7 |
20011122001111 has 8 divisors (see below), whose sum is σ = 20901424126464. Its totient is φ = 19122507654360.
The previous prime is 20011122001099. The next prime is 20011122001121. The reversal of 20011122001111 is 11110022111002.
It is a happy number.
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 20011122001111 - 217 = 20011121870039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20011122001091 and 20011122001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011122001121) 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, 421920411 + ... + 421967836.
It is an arithmetic number, because the mean of its divisors is an integer number (2612678015808).
Almost surely, 220011122001111 is an apocalyptic number.
20011122001111 is a deficient number, since it is larger than the sum of its proper divisors (890302125353).
20011122001111 is a wasteful number, since it uses less digits than its factorization.
20011122001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 843889301.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20011122001111 its reverse (11110022111002), we get a palindrome (31121144112113).
The spelling of 20011122001111 in words is "twenty trillion, eleven billion, one hundred twenty-two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •