Base | Representation |
---|---|
bin | 1010000000101000111011… |
… | …11101010101011110011011 |
3 | 2212221100100202121010112211 |
4 | 11000110131331111132123 |
5 | 10341122001230310021 |
6 | 114452134130015551 |
7 | 4431221040631534 |
oct | 500243575253633 |
9 | 85840322533484 |
10 | 22012210010011 |
11 | 701736476a091 |
12 | 25761447175b7 |
13 | c389863601b0 |
14 | 56157a59568b |
15 | 2828c4c693e1 |
hex | 14051df5579b |
22012210010011 has 8 divisors (see below), whose sum is σ = 23886414622224. Its totient is φ = 20163856496160.
The previous prime is 22012210009981. The next prime is 22012210010029. The reversal of 22012210010011 is 11001001221022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22012210010011 - 215 = 22012209977243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22012210009973 and 22012210010000.
It is not an unprimeable number, because it can be changed into a prime (22012210010051) 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, 6462772816 + ... + 6462776221.
It is an arithmetic number, because the mean of its divisors is an integer number (2985801827778).
Almost surely, 222012210010011 is an apocalyptic number.
22012210010011 is a deficient number, since it is larger than the sum of its proper divisors (1874204612213).
22012210010011 is a wasteful number, since it uses less digits than its factorization.
22012210010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12925549181.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22012210010011 its reverse (11001001221022), we get a palindrome (33013211231033).
The spelling of 22012210010011 in words is "twenty-two trillion, twelve billion, two hundred ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •