Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …00101011110101111000011 |
3 | 2122012111222212221001012220 |
4 | 10210221012211132233003 |
5 | 10113441213101011321 |
6 | 110434301423022123 |
7 | 4143626012011341 |
oct | 444510645365703 |
9 | 78174885831186 |
10 | 20110221110211 |
11 | 64537735a9561 |
12 | 23095b443a943 |
13 | b2b50254978b |
14 | 4d74a895a991 |
15 | 24d1a65a79c6 |
hex | 124a4695ebc3 |
20110221110211 has 4 divisors (see below), whose sum is σ = 26813628146952. Its totient is φ = 13406814073472.
The previous prime is 20110221110173. The next prime is 20110221110219. The reversal of 20110221110211 is 11201112201102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20110221110211 - 235 = 20075861371843 is a prime.
It is a super-2 number, since 2×201102211102112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20110221110219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3351703518366 + ... + 3351703518371.
It is an arithmetic number, because the mean of its divisors is an integer number (6703407036738).
Almost surely, 220110221110211 is an apocalyptic number.
20110221110211 is a deficient number, since it is larger than the sum of its proper divisors (6703407036741).
20110221110211 is an equidigital number, since it uses as much as digits as its factorization.
20110221110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6703407036740.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20110221110211 its reverse (11201112201102), we get a palindrome (31311333311313).
The spelling of 20110221110211 in words is "twenty trillion, one hundred ten billion, two hundred twenty-one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •