Base | Representation |
---|---|
bin | 10001100111111100011… |
… | …100000000100110101000 |
3 | 11021210010002212000020220 |
4 | 101213330130000212220 |
5 | 124320333434323422 |
6 | 2324214210250040 |
7 | 153333464510655 |
oct | 21477434004650 |
9 | 4253102760226 |
10 | 1211121011112 |
11 | 4276a7267371 |
12 | 176881b86920 |
13 | 8a29260155c |
14 | 428934d8c2c |
15 | 217861cee5c |
hex | 119fc7009a8 |
1211121011112 has 32 divisors (see below), whose sum is σ = 3027841771680. Its totient is φ = 403701771200.
The previous prime is 1211121011101. The next prime is 1211121011119. The reversal of 1211121011112 is 2111101211121.
It is a junction number, because it is equal to n+sod(n) for n = 1211121011091 and 1211121011100.
It is not an unprimeable number, because it can be changed into a prime (1211121011119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1862362 + ... + 2427062.
It is an arithmetic number, because the mean of its divisors is an integer number (94620055365).
Almost surely, 21211121011112 is an apocalyptic number.
1211121011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1211121011112 is an abundant number, since it is smaller than the sum of its proper divisors (1816720760568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1211121011112 is a wasteful number, since it uses less digits than its factorization.
1211121011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654073 (or 654069 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 1211121011112 its reverse (2111101211121), we get a palindrome (3322222222233).
The spelling of 1211121011112 in words is "one trillion, two hundred eleven billion, one hundred twenty-one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •