Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101011100100111111000 |
3 | 1102222122120111110020110102 |
4 | 2200032320231130213320 |
5 | 2420401213111213422 |
6 | 35230232441134532 |
7 | 2214345216402206 |
oct | 240167055344770 |
9 | 42878514406412 |
10 | 11011100101112 |
11 | 3565865a481a1 |
12 | 129a03718a448 |
13 | 61b45acc9217 |
14 | 2a0d23862076 |
15 | 141655e1d192 |
hex | a03b8b5c9f8 |
11011100101112 has 16 divisors (see below), whose sum is σ = 20646104871600. Its totient is φ = 5505472135360.
The previous prime is 11011100101091. The next prime is 11011100101117. The reversal of 11011100101112 is 21110100111011.
It is a happy number.
11011100101112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11011100101093 and 11011100101102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011100101117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9136589 + ... + 10271292.
It is an arithmetic number, because the mean of its divisors is an integer number (1290381554475).
Almost surely, 211011100101112 is an apocalyptic number.
It is an amenable number.
11011100101112 is a deficient number, since it is larger than the sum of its proper divisors (9635004770488).
11011100101112 is a wasteful number, since it uses less digits than its factorization.
11011100101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19478806 (or 19478802 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11011100101112 its reverse (21110100111011), we get a palindrome (32121200212123).
The spelling of 11011100101112 in words is "eleven trillion, eleven billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •