Base | Representation |
---|---|
bin | 110000000000001101111101… |
… | …010101000010001111111000 |
3 | 1000200111222202211021220110100 |
4 | 300000031331111002033320 |
5 | 210133002224321213422 |
6 | 2025003425524315400 |
7 | 62320001434411506 |
oct | 6000157525021770 |
9 | 1020458684256410 |
10 | 211121220101112 |
11 | 612a7008912402 |
12 | 1b818859542b60 |
13 | 90a58515abbc9 |
14 | 3a1c470585676 |
15 | 1961b328aa7ac |
hex | c0037d5423f8 |
211121220101112 has 48 divisors (see below), whose sum is σ = 577447891633080. Its totient is φ = 69676970328000.
The previous prime is 211121220101069. The next prime is 211121220101119. The reversal of 211121220101112 is 211101022121112.
It is a happy number.
211121220101112 is a `hidden beast` number, since 211 + 1 + 21 + 220 + 101 + 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 (211121220101119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14516028214 + ... + 14516042757.
Almost surely, 2211121220101112 is an apocalyptic number.
It is an amenable number.
211121220101112 is an abundant number, since it is smaller than the sum of its proper divisors (366326671531968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211121220101112 is a wasteful number, since it uses less digits than its factorization.
211121220101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29032071084 (or 29032071077 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 211121220101112 its reverse (211101022121112), we get a palindrome (422222242222224).
The spelling of 211121220101112 in words is "two hundred eleven trillion, one hundred twenty-one billion, two hundred twenty million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •