Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00001010100111011 |
3 | 1001102101022221100000 |
4 | 22100110001110323 |
5 | 140022320231021 |
6 | 5020342044043 |
7 | 536602552140 |
oct | 122024012473 |
9 | 31371287300 |
10 | 11011102011 |
11 | 4740530a08 |
12 | 2173719623 |
13 | 10663139a0 |
14 | 7665603c7 |
15 | 446a33b26 |
hex | 29050153b |
11011102011 has 144 divisors (see below), whose sum is σ = 21577197824. Its totient is φ = 5463230976.
The previous prime is 11011101989. The next prime is 11011102019. The reversal of 11011102011 is 11020111011.
It is not a de Polignac number, because 11011102011 - 27 = 11011101883 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 = 11011101984 and 11011102002.
It is not an unprimeable number, because it can be changed into a prime (11011102019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 6389796 + ... + 6391518.
Almost surely, 211011102011 is an apocalyptic number.
11011102011 is a deficient number, since it is larger than the sum of its proper divisors (10566095813).
11011102011 is a wasteful number, since it uses less digits than its factorization.
11011102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792 (or 1763 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011102011 its reverse (11020111011), we get a palindrome (22031213022).
The spelling of 11011102011 in words is "eleven billion, eleven million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •