Base | Representation |
---|---|
bin | 11101011011010101110… |
… | …11001010110010000000 |
3 | 10120122212002010101022111 |
4 | 32231222323022302000 |
5 | 113031223432210422 |
6 | 2052255330145104 |
7 | 133023164323423 |
oct | 16555273126200 |
9 | 3518762111274 |
10 | 1011111210112 |
11 | 35a89aa11573 |
12 | 143b63122194 |
13 | 74469260293 |
14 | 36d1bdc59ba |
15 | 1b47be71a77 |
hex | eb6aecac80 |
1011111210112 has 32 divisors (see below), whose sum is σ = 2014432761600. Its totient is φ = 505528085760.
The previous prime is 1011111210077. The next prime is 1011111210121. The reversal of 1011111210112 is 2110121111101.
1011111210112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×10111112101122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011111210092 and 1011111210101.
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, 2256189 + ... + 2666947.
It is an arithmetic number, because the mean of its divisors is an integer number (62951023800).
Almost surely, 21011111210112 is an apocalyptic number.
It is an amenable number.
1011111210112 is a deficient number, since it is larger than the sum of its proper divisors (1003321551488).
1011111210112 is an equidigital number, since it uses as much as digits as its factorization.
1011111210112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 430004 (or 429992 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1011111210112 its reverse (2110121111101), we get a palindrome (3121232321213).
The spelling of 1011111210112 in words is "one trillion, eleven billion, one hundred eleven million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •