Base | Representation |
---|---|
bin | 1001001001010100000100… |
… | …00111111111000000000011 |
3 | 2122012121120111112110111211 |
4 | 10210222002013333000003 |
5 | 10114000234310323021 |
6 | 110434544504550551 |
7 | 4143662531353513 |
oct | 444520207770003 |
9 | 78177514473454 |
10 | 20111220011011 |
11 | 6454136441508 |
12 | 2309832a82457 |
13 | b2b63149053c |
14 | 4d756149d843 |
15 | 24d21411d3e1 |
hex | 124a821ff003 |
20111220011011 has 16 divisors (see below), whose sum is σ = 20233788620800. Its totient is φ = 19989142558560.
The previous prime is 20111220011009. The next prime is 20111220011083. The reversal of 20111220011011 is 11011002211102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20111220011011 - 21 = 20111220011009 is a prime.
It is a super-2 number, since 2×201112200110112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20111220010982 and 20111220011000.
It is not an unprimeable number, because it can be changed into a prime (20111220017011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 124370590 + ... + 124532188.
It is an arithmetic number, because the mean of its divisors is an integer number (1264611788800).
Almost surely, 220111220011011 is an apocalyptic number.
20111220011011 is a deficient number, since it is larger than the sum of its proper divisors (122568609789).
20111220011011 is a wasteful number, since it uses less digits than its factorization.
20111220011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163114.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20111220011011 its reverse (11011002211102), we get a palindrome (31122222222113).
The spelling of 20111220011011 in words is "twenty trillion, one hundred eleven billion, two hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •