Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …1001100011011100101111 |
3 | 1102222122100021210102212100 |
4 | 2200032303121203130233 |
5 | 2420401022304000421 |
6 | 35230215535310143 |
7 | 2214343055142423 |
oct | 240166331433457 |
9 | 42878307712770 |
10 | 11011011000111 |
11 | 356581a720301 |
12 | 129a01137b353 |
13 | 61b445700535 |
14 | 2a0d15aaab83 |
15 | 14164d1bcc26 |
hex | a03b366372f |
11011011000111 has 48 divisors (see below), whose sum is σ = 16207871899648. Its totient is φ = 7201443412800.
The previous prime is 11011011000091. The next prime is 11011011000113. The reversal of 11011011000111 is 11100011011011.
It is not a de Polignac number, because 11011011000111 - 27 = 11011010999983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011011000093 and 11011011000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011011000113) 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 47 ways as a sum of consecutive naturals, for example, 398488266 + ... + 398515896.
Almost surely, 211011011000111 is an apocalyptic number.
11011011000111 is a deficient number, since it is larger than the sum of its proper divisors (5196860899537).
11011011000111 is a wasteful number, since it uses less digits than its factorization.
11011011000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29572 (or 29569 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011011000111 its reverse (11100011011011), we get a palindrome (22111022011122).
The spelling of 11011011000111 in words is "eleven trillion, eleven billion, eleven million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •