Base | Representation |
---|---|
bin | 1010000000101000101110… |
… | …11101111010100101100000 |
3 | 2212221100002011200102222020 |
4 | 11000110113131322211200 |
5 | 10341121240341010422 |
6 | 114452115235541440 |
7 | 4431215246201241 |
oct | 500242735724540 |
9 | 85840064612866 |
10 | 22012101110112 |
11 | 7017309249a73 |
12 | 257611415a880 |
13 | c38969921799 |
14 | 561569d28cc8 |
15 | 2828ba40795c |
hex | 14051777a960 |
22012101110112 has 24 divisors (see below), whose sum is σ = 57781765414296. Its totient is φ = 7337367036672.
The previous prime is 22012101110107. The next prime is 22012101110137. The reversal of 22012101110112 is 21101110121022.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 22012101110091 and 22012101110100.
It is a congruent number.
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, 114646359853 + ... + 114646360044.
It is an arithmetic number, because the mean of its divisors is an integer number (2407573558929).
Almost surely, 222012101110112 is an apocalyptic number.
It is an amenable number.
22012101110112 is an abundant number, since it is smaller than the sum of its proper divisors (35769664304184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22012101110112 is a wasteful number, since it uses less digits than its factorization.
22012101110112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229292719910 (or 229292719902 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 22012101110112 its reverse (21101110121022), we get a palindrome (43113211231134).
The spelling of 22012101110112 in words is "twenty-two trillion, twelve billion, one hundred one million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •