Base | Representation |
---|---|
bin | 1010000000100111000100… |
… | …11010110011100000000011 |
3 | 2212221020210010222100122122 |
4 | 11000103202122303200003 |
5 | 10341112430020232321 |
6 | 114451451043554455 |
7 | 4431154221230102 |
oct | 500234232634003 |
9 | 85836703870578 |
10 | 22011211102211 |
11 | 70169a1921951 |
12 | 2575b0608ba2b |
13 | c388574161a6 |
14 | 5614c3a50039 |
15 | 2828672018ab |
hex | 1404e26b3803 |
22011211102211 has 32 divisors (see below), whose sum is σ = 23610014991360. Its totient is φ = 20469564544000.
The previous prime is 22011211102171. The next prime is 22011211102229. The reversal of 22011211102211 is 11220111211022.
It is a cyclic number.
It is not a de Polignac number, because 22011211102211 - 26 = 22011211102147 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 22011211102211.
It is not an unprimeable number, because it can be changed into a prime (22011211152211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 350460011 + ... + 350522811.
It is an arithmetic number, because the mean of its divisors is an integer number (737812968480).
Almost surely, 222011211102211 is an apocalyptic number.
22011211102211 is a deficient number, since it is larger than the sum of its proper divisors (1598803889149).
22011211102211 is a wasteful number, since it uses less digits than its factorization.
22011211102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64147.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 22011211102211 its reverse (11220111211022), we get a palindrome (33231322313233).
The spelling of 22011211102211 in words is "twenty-two trillion, eleven billion, two hundred eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •