Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0000011001101000101011 |
3 | 1102222122022112111100101002 |
4 | 2200032302300121220223 |
5 | 2420401012023241021 |
6 | 35230214512145215 |
7 | 2214342564351302 |
oct | 240166260315053 |
9 | 42878275440332 |
10 | 11011000212011 |
11 | 3565814622018 |
12 | 129a00983820b |
13 | 61b4433c4047 |
14 | 2a0d1449d439 |
15 | 14164c28b50b |
hex | a03b2c19a2b |
11011000212011 has 8 divisors (see below), whose sum is σ = 11040779161104. Its totient is φ = 10981222647840.
The previous prime is 11011000211963. The next prime is 11011000212041. The reversal of 11011000212011 is 11021200011011.
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 11011000212011 - 214 = 11011000195627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011000211983 and 11011000212001.
It is not an unprimeable number, because it can be changed into a prime (11011000212041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16710581 + ... + 17357001.
It is an arithmetic number, because the mean of its divisors is an integer number (1380097395138).
Almost surely, 211011000212011 is an apocalyptic number.
11011000212011 is a deficient number, since it is larger than the sum of its proper divisors (29778949093).
11011000212011 is an equidigital number, since it uses as much as digits as its factorization.
11011000212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692461.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011000212011 its reverse (11021200011011), we get a palindrome (22032200223022).
The spelling of 11011000212011 in words is "eleven trillion, eleven billion, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •