Base | Representation |
---|---|
bin | 1010000000110111110100… |
… | …1010001110001001000011 |
3 | 1102222112222212111012111100 |
4 | 2200031331022032021003 |
5 | 2420342141324323021 |
6 | 35225545351145443 |
7 | 2214311365311114 |
oct | 240157512161103 |
9 | 42875885435440 |
10 | 11010101011011 |
11 | 35653a2a95aa3 |
12 | 12999b8675283 |
13 | 61b32c01a24b |
14 | 2a0c6acb020b |
15 | 1415e836b626 |
hex | a037d28e243 |
11010101011011 has 24 divisors (see below), whose sum is σ = 16595150996736. Its totient is φ = 7020842534640.
The previous prime is 11010101010989. The next prime is 11010101011031. The reversal of 11010101011011 is 11011010101011.
It is not a de Polignac number, because 11010101011011 - 29 = 11010101010499 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 = 11010101010984 and 11010101011002.
It is not an unprimeable number, because it can be changed into a prime (11010101011031) 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 23 ways as a sum of consecutive naturals, for example, 17901796 + ... + 18506606.
It is an arithmetic number, because the mean of its divisors is an integer number (691464624864).
Almost surely, 211010101011011 is an apocalyptic number.
11010101011011 is a deficient number, since it is larger than the sum of its proper divisors (5585049985725).
11010101011011 is a wasteful number, since it uses less digits than its factorization.
11010101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692783 (or 692780 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11010101011011 its reverse (11011010101011), we get a palindrome (22021111112022).
The spelling of 11010101011011 in words is "eleven trillion, ten billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •