Base | Representation |
---|---|
bin | 110000000000000011100111… |
… | …001011001110000011000011 |
3 | 1000200110221002121120122201211 |
4 | 300000003213023032003003 |
5 | 210132312001404323021 |
6 | 2024554351322110551 |
7 | 62316126231613642 |
oct | 6000034713160303 |
9 | 1020427077518654 |
10 | 211110111011011 |
11 | 612a2328044603 |
12 | 1b81667904b457 |
13 | 90a47a0baa404 |
14 | 3a1bad8dd9359 |
15 | 19616d246d3e1 |
hex | c000e72ce0c3 |
211110111011011 has 8 divisors (see below), whose sum is σ = 212079496938624. Its totient is φ = 210140927796480.
The previous prime is 211110111010987. The next prime is 211110111011029. The reversal of 211110111011011 is 110110111011112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211110111011011 - 223 = 211110102622403 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211110111010982 and 211110111011000.
It is not an unprimeable number, because it can be changed into a prime (211110111011311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48590446 + ... + 52756531.
It is an arithmetic number, because the mean of its divisors is an integer number (26509937117328).
Almost surely, 2211110111011011 is an apocalyptic number.
211110111011011 is a deficient number, since it is larger than the sum of its proper divisors (969385927613).
211110111011011 is a wasteful number, since it uses less digits than its factorization.
211110111011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101356541.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 211110111011011 its reverse (110110111011112), we get a palindrome (321220222022123).
The spelling of 211110111011011 in words is "two hundred eleven trillion, one hundred ten billion, one hundred eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •