Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …00101110111011001001011 |
3 | 2122012111222220010011202122 |
4 | 10210221012211313121023 |
5 | 10113441213112224321 |
6 | 110434301425121455 |
7 | 4143626012611655 |
oct | 444510645673113 |
9 | 78174886104678 |
10 | 20110221211211 |
11 | 645377366842a |
12 | 23095b448928b |
13 | b2b502583741 |
14 | 4d74a89856d5 |
15 | 24d1a65c78ab |
hex | 124a4697764b |
20110221211211 has 8 divisors (see below), whose sum is σ = 20336312466000. Its totient is φ = 19884132928000.
The previous prime is 20110221211207. The next prime is 20110221211237. The reversal of 20110221211211 is 11211212201102.
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 20110221211211 - 22 = 20110221211207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20110221211211.
It is not an unprimeable number, because it can be changed into a prime (20110221214211) 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, 14651240 + ... + 15964938.
It is an arithmetic number, because the mean of its divisors is an integer number (2542039058250).
Almost surely, 220110221211211 is an apocalyptic number.
20110221211211 is a deficient number, since it is larger than the sum of its proper divisors (226091254789).
20110221211211 is a wasteful number, since it uses less digits than its factorization.
20110221211211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1485789.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20110221211211 its reverse (11211212201102), we get a palindrome (31321433412313).
The spelling of 20110221211211 in words is "twenty trillion, one hundred ten billion, two hundred twenty-one million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •