Base | Representation |
---|---|
bin | 10100100000110110… |
… | …10101100101101011 |
3 | 1001102111221101100001 |
4 | 22100123111211223 |
5 | 140023313120021 |
6 | 5020451123431 |
7 | 536625061030 |
oct | 122033254553 |
9 | 31374841301 |
10 | 11013020011 |
11 | 4741620a34 |
12 | 21742a3577 |
13 | 10668359b6 |
14 | 7668dd387 |
15 | 446cb2091 |
hex | 2906d596b |
11013020011 has 32 divisors (see below), whose sum is σ = 13436190720. Its totient is φ = 8823409056.
The previous prime is 11013020009. The next prime is 11013020059. The reversal of 11013020011 is 11002031011.
11013020011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11013020011 - 21 = 11013020009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11013020011.
It is not an unprimeable number, because it can be changed into a prime (11013020411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1365930 + ... + 1373968.
It is an arithmetic number, because the mean of its divisors is an integer number (419880960).
Almost surely, 211013020011 is an apocalyptic number.
11013020011 is a deficient number, since it is larger than the sum of its proper divisors (2423170709).
11013020011 is a wasteful number, since it uses less digits than its factorization.
11013020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8263.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 11013020011 its reverse (11002031011), we get a palindrome (22015051022).
The spelling of 11013020011 in words is "eleven billion, thirteen million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •