Base | Representation |
---|---|
bin | 1001100110011010100001… |
… | …10100001010100111111010 |
3 | 2202202012111020222111111000 |
4 | 10303031100310022213322 |
5 | 10231341033222041442 |
6 | 112522151550145430 |
7 | 4306141144111245 |
oct | 463152064124772 |
9 | 82665436874430 |
10 | 21111120112122 |
11 | 67aa1a2a34937 |
12 | 244b5874b2276 |
13 | ba1a01b4c5c1 |
14 | 52dad854025c |
15 | 269236beed4c |
hex | 133350d0a9fa |
21111120112122 has 32 divisors (see below), whose sum is σ = 46914436877760. Its totient is φ = 7036914543120.
The previous prime is 21111120112057. The next prime is 21111120112153. The reversal of 21111120112122 is 22121102111112.
It is a happy number.
21111120112122 is a `hidden beast` number, since 211 + 111 + 201 + 121 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21111120112095 and 21111120112104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 404904 + ... + 6510467.
It is an arithmetic number, because the mean of its divisors is an integer number (1466076152430).
Almost surely, 221111120112122 is an apocalyptic number.
21111120112122 is an abundant number, since it is smaller than the sum of its proper divisors (25803316765638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111120112122 is a wasteful number, since it uses less digits than its factorization.
21111120112122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6971915 (or 6971909 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 21111120112122 its reverse (22121102111112), we get a palindrome (43232222223234).
The spelling of 21111120112122 in words is "twenty-one trillion, one hundred eleven billion, one hundred twenty million, one hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •