Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …1010111010111001001011 |
3 | 1110101001220221220011212201 |
4 | 2201310121222322321023 |
5 | 2424142431324323034 |
6 | 35352300501021031 |
7 | 2225254320011440 |
oct | 241643152727113 |
9 | 43331827804781 |
10 | 11120101011019 |
11 | 35a8010136110 |
12 | 12b71973b4777 |
13 | 62880c517150 |
14 | 2a63040939c7 |
15 | 1443d5464014 |
hex | a1d19abae4b |
11120101011019 has 128 divisors (see below), whose sum is σ = 15910517145600. Its totient is φ = 7488901854720.
The previous prime is 11120101011017. The next prime is 11120101011023. The reversal of 11120101011019 is 91011010102111.
It is not a de Polignac number, because 11120101011019 - 21 = 11120101011017 is a prime.
It is a super-3 number, since 3×111201010110193 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 11120101010987 and 11120101011005.
It is not an unprimeable number, because it can be changed into a prime (11120101011013) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 535665762 + ... + 535686520.
It is an arithmetic number, because the mean of its divisors is an integer number (124300915200).
Almost surely, 211120101011019 is an apocalyptic number.
11120101011019 is a deficient number, since it is larger than the sum of its proper divisors (4790416134581).
11120101011019 is a wasteful number, since it uses less digits than its factorization.
11120101011019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21305.
The product of its (nonzero) digits is 18, while the sum is 19.
The spelling of 11120101011019 in words is "eleven trillion, one hundred twenty billion, one hundred one million, eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •