Base | Representation |
---|---|
bin | 1010000000100110101100… |
… | …11111100011010011101100 |
3 | 2212221020021012111010110211 |
4 | 11000103112133203103230 |
5 | 10341112022310120022 |
6 | 114451415135312204 |
7 | 4431146241451060 |
oct | 500232637432354 |
9 | 85836235433424 |
10 | 22011011020012 |
11 | 70168a9993163 |
12 | 2575a6b07b664 |
13 | c38824b30661 |
14 | 5614a5249aa0 |
15 | 28285487ce77 |
hex | 1404d67e34ec |
22011011020012 has 12 divisors (see below), whose sum is σ = 44022022040080. Its totient is φ = 9433290437136.
The previous prime is 22011011020003. The next prime is 22011011020021. The reversal of 22011011020012 is 21002011011022.
It is an interprime number because it is at equal distance from previous prime (22011011020003) and next prime (22011011020021).
22011011020012 is an admirable number.
It is a super-2 number, since 2×220110110200122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22011011019974 and 22011011020001.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393053768187 + ... + 393053768242.
Almost surely, 222011011020012 is an apocalyptic number.
It is an amenable number.
22011011020012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011011020012 is a wasteful number, since it uses less digits than its factorization.
22011011020012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 786107536440 (or 786107536438 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22011011020012 its reverse (21002011011022), we get a palindrome (43013022031034).
The spelling of 22011011020012 in words is "twenty-two trillion, eleven billion, eleven million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •