Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1001111110100100101011 |
3 | 1102222122100022000002021011 |
4 | 2200032303121332210223 |
5 | 2420401022321024321 |
6 | 35230215541524351 |
7 | 2214343056114346 |
oct | 240166331764453 |
9 | 42878308002234 |
10 | 11011011111211 |
11 | 356581a796821 |
12 | 129a0114136b7 |
13 | 61b44573bc87 |
14 | 2a0d15ad945d |
15 | 14164d1e0ae1 |
hex | a03b367e92b |
11011011111211 has 16 divisors (see below), whose sum is σ = 11041547156640. Its totient is φ = 10980532200960.
The previous prime is 11011011111197. The next prime is 11011011111271. The reversal of 11011011111211 is 11211111011011.
It is a cyclic number.
It is not a de Polignac number, because 11011011111211 - 217 = 11011010980139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011011111191 and 11011011111200.
It is not an unprimeable number, because it can be changed into a prime (11011011111271) 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 15 ways as a sum of consecutive naturals, for example, 1674165955 + ... + 1674172531.
It is an arithmetic number, because the mean of its divisors is an integer number (690096697290).
Almost surely, 211011011111211 is an apocalyptic number.
11011011111211 is a deficient number, since it is larger than the sum of its proper divisors (30536045429).
11011011111211 is a wasteful number, since it uses less digits than its factorization.
11011011111211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10254.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 11011011111211 its reverse (11211111011011), we get a palindrome (22222122122222).
The spelling of 11011011111211 in words is "eleven trillion, eleven billion, eleven million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •