Base | Representation |
---|---|
bin | 11101011011010101111… |
… | …10001110010101101000 |
3 | 10120122212010122002002011 |
4 | 32231222332032111220 |
5 | 113031224133323422 |
6 | 2052255355245304 |
7 | 133023204200620 |
oct | 16555276162550 |
9 | 3518763562064 |
10 | 1011112011112 |
11 | 35a8a0409355 |
12 | 143b63449834 |
13 | 74469480a48 |
14 | 36d1c153880 |
15 | 1b47c07e077 |
hex | eb6af8e568 |
1011112011112 has 16 divisors (see below), whose sum is σ = 2166668595360. Its totient is φ = 433333719024.
The previous prime is 1011112011089. The next prime is 1011112011121. The reversal of 1011112011112 is 2111102111101.
It is a super-2 number, since 2×10111120111122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1011112011092 and 1011112011101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9027785758 + ... + 9027785869.
It is an arithmetic number, because the mean of its divisors is an integer number (135416787210).
Almost surely, 21011112011112 is an apocalyptic number.
It is an amenable number.
1011112011112 is an abundant number, since it is smaller than the sum of its proper divisors (1155556584248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011112011112 is a wasteful number, since it uses less digits than its factorization.
1011112011112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18055571640 (or 18055571636 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1011112011112 its reverse (2111102111101), we get a palindrome (3122214122213).
The spelling of 1011112011112 in words is "one trillion, eleven billion, one hundred twelve million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •