Base | Representation |
---|---|
bin | 1010000000100110110111… |
… | …10110110011100111100100 |
3 | 2212221020111110210200211220 |
4 | 11000103123312303213210 |
5 | 10341112213324032322 |
6 | 114451432112100340 |
7 | 4431151413340620 |
oct | 500233366634744 |
9 | 85836443720756 |
10 | 22011101002212 |
11 | 7016945762113 |
12 | 2575a952346b0 |
13 | c3883a67746a |
14 | 5614b3190180 |
15 | 28285c70455c |
hex | 1404dbdb39e4 |
22011101002212 has 96 divisors (see below), whose sum is σ = 58872007670784. Its totient is φ = 6270067440000.
The previous prime is 22011101002141. The next prime is 22011101002243. The reversal of 22011101002212 is 21220010111022.
It is a super-2 number, since 2×220111010022122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22011101002191 and 22011101002200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 101752287 + ... + 101968377.
It is an arithmetic number, because the mean of its divisors is an integer number (613250079904).
Almost surely, 222011101002212 is an apocalyptic number.
It is an amenable number.
22011101002212 is an abundant number, since it is smaller than the sum of its proper divisors (36860906668572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011101002212 is a wasteful number, since it uses less digits than its factorization.
22011101002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219729 (or 219727 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22011101002212 its reverse (21220010111022), we get a palindrome (43231111113234).
The spelling of 22011101002212 in words is "twenty-two trillion, eleven billion, one hundred one million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •