Base | Representation |
---|---|
bin | 1010000000010100010000… |
… | …11110101000010110111000 |
3 | 2212220021201100011001011100 |
4 | 11000022020132220112320 |
5 | 10340431234212033422 |
6 | 114443101005531400 |
7 | 4430346033163053 |
oct | 500121036502670 |
9 | 85807640131140 |
10 | 22001112221112 |
11 | 701268a310022 |
12 | 2573b67b73b60 |
13 | c379080b75bb |
14 | 560c0670ba9a |
15 | 2824758107ac |
hex | 1402887a85b8 |
22001112221112 has 96 divisors (see below), whose sum is σ = 61281579181680. Its totient is φ = 7126791436800.
The previous prime is 22001112221047. The next prime is 22001112221117. The reversal of 22001112221112 is 21112221110022.
22001112221112 is a `hidden beast` number, since 220 + 0 + 1 + 112 + 221 + 112 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001112221117) 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 23 ways as a sum of consecutive naturals, for example, 17426389 + ... + 18646212.
Almost surely, 222001112221112 is an apocalyptic number.
It is an amenable number.
22001112221112 is an abundant number, since it is smaller than the sum of its proper divisors (39280466960568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001112221112 is a wasteful number, since it uses less digits than its factorization.
22001112221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36072853 (or 36072846 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 22001112221112 its reverse (21112221110022), we get a palindrome (43113333331134).
The spelling of 22001112221112 in words is "twenty-two trillion, one billion, one hundred twelve million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •