Base | Representation |
---|---|
bin | 11110100100101101111… |
… | …101001001001110000011 |
3 | 21102212002000000001212000 |
4 | 132210231331021032003 |
5 | 233410332030323021 |
6 | 4245105104035043 |
7 | 304535662301052 |
oct | 36445575111603 |
9 | 7385060001760 |
10 | 2101010011011 |
11 | 74004041812a |
12 | 29b234002a83 |
13 | 1231803a7862 |
14 | 73991b06399 |
15 | 399bac24b26 |
hex | 1e92df49383 |
2101010011011 has 32 divisors (see below), whose sum is σ = 3141119520000. Its totient is φ = 1387850534784.
The previous prime is 2101010011003. The next prime is 2101010011091. The reversal of 2101010011011 is 1101100101012.
It is not a de Polignac number, because 2101010011011 - 23 = 2101010011003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2101010010984 and 2101010011002.
It is not an unprimeable number, because it can be changed into a prime (2101010011091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9960880 + ... + 10169618.
It is an arithmetic number, because the mean of its divisors is an integer number (98159985000).
Almost surely, 22101010011011 is an apocalyptic number.
2101010011011 is a deficient number, since it is larger than the sum of its proper divisors (1040109508989).
2101010011011 is a wasteful number, since it uses less digits than its factorization.
2101010011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212160 (or 212154 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2101010011011 its reverse (1101100101012), we get a palindrome (3202110112023).
Subtracting from 2101010011011 its reverse (1101100101012), we obtain a palindrome (999909909999).
The spelling of 2101010011011 in words is "two trillion, one hundred one billion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •