Base | Representation |
---|---|
bin | 1010000110001010011111… |
… | …0100101110110011001000 |
3 | 1110022020122112212210020211 |
4 | 2201202213310232303020 |
5 | 2423334332321023422 |
6 | 35335422322130504 |
7 | 2224010255360536 |
oct | 241424764566310 |
9 | 43266575783224 |
10 | 11101011111112 |
11 | 359aa0440782a |
12 | 12b354a1b0a34 |
13 | 626a895611a0 |
14 | 2a54129d7156 |
15 | 143b6956c577 |
hex | a18a7d2ecc8 |
11101011111112 has 32 divisors (see below), whose sum is σ = 22633129471680. Its totient is φ = 5073800443200.
The previous prime is 11101011111101. The next prime is 11101011111133. The reversal of 11101011111112 is 21111111010111.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 11101011111092 and 11101011111101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 518147014 + ... + 518168437.
It is an arithmetic number, because the mean of its divisors is an integer number (707285295990).
Almost surely, 211101011111112 is an apocalyptic number.
It is an amenable number.
11101011111112 is an abundant number, since it is smaller than the sum of its proper divisors (11532118360568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101011111112 is a wasteful number, since it uses less digits than its factorization.
11101011111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1036315573 (or 1036315569 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 11101011111112 its reverse (21111111010111), we get a palindrome (32212122121223).
The spelling of 11101011111112 in words is "eleven trillion, one hundred one billion, eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •