Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01011000111000011 |
3 | 1001102101011022111122 |
4 | 22100103223013003 |
5 | 140022304323021 |
6 | 5020340102455 |
7 | 536602022630 |
oct | 122023530703 |
9 | 31371138448 |
10 | 11011011011 |
11 | 4740479600 |
12 | 2173694a2b |
13 | 10662b1440 |
14 | 766539187 |
15 | 446a16bab |
hex | 2904eb1c3 |
11011011011 has 48 divisors (see below), whose sum is σ = 15045019584. Its totient is φ = 7840800000.
The previous prime is 11011011001. The next prime is 11011011017.
11011011011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11011011011 - 210 = 11011009987 is a prime.
11011011011 is a strobogrammatic number because it is the same when read upside-down.
11011011011 is a modest number, since divided by 11011011 gives 11 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 11011011011.
It is not an unprimeable number, because it can be changed into a prime (11011011017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1107161 + ... + 1117061.
It is an arithmetic number, because the mean of its divisors is an integer number (313437908).
Almost surely, 211011011011 is an apocalyptic number.
11011011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11011011011 is a deficient number, since it is larger than the sum of its proper divisors (4034008573).
11011011011 is a wasteful number, since it uses less digits than its factorization.
11011011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10044 (or 10033 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 8.
It can be divided in two parts, 110110 and 11011, that added together give a palindrome (121121).
The spelling of 11011011011 in words is "eleven billion, eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •