Base | Representation |
---|---|
bin | 1001101001100101010110… |
… | …01110101111100101100110 |
3 | 2210010121120001210110122020 |
4 | 10310302223032233211212 |
5 | 10240132040332223420 |
6 | 113044201044244010 |
7 | 4320044442144165 |
oct | 464625316574546 |
9 | 83117501713566 |
10 | 21220011211110 |
11 | 68413a1140228 |
12 | 24686b69a0606 |
13 | bac0666a025a |
14 | 5350a83493dc |
15 | 26beab7a4340 |
hex | 134cab3af966 |
21220011211110 has 32 divisors (see below), whose sum is σ = 50930036381952. Its totient is φ = 5658446381280.
The previous prime is 21220011211057. The next prime is 21220011211117. The reversal of 21220011211110 is 1111211002212.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 21220011211110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220011211117) 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, 13180996 + ... + 14703015.
It is an arithmetic number, because the mean of its divisors is an integer number (1591563636936).
Almost surely, 221220011211110 is an apocalyptic number.
21220011211110 is an abundant number, since it is smaller than the sum of its proper divisors (29710025170842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21220011211110 is a wasteful number, since it uses less digits than its factorization.
21220011211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27909388.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21220011211110 its reverse (1111211002212), we get a palindrome (22331222213322).
The spelling of 21220011211110 in words is "twenty-one trillion, two hundred twenty billion, eleven million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •