Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …0011010111001011101011 |
3 | 1102221210002022000211000100 |
4 | 2200012122103113023223 |
5 | 2420224044000341021 |
6 | 35222125442440443 |
7 | 2213603550045201 |
oct | 240063223271353 |
9 | 42853068024010 |
10 | 11002000012011 |
11 | 3561a162045a8 |
12 | 1298317663123 |
13 | 61a63a8a3a08 |
14 | 2a06dd035071 |
15 | 1412c2070626 |
hex | a019a4d72eb |
11002000012011 has 96 divisors (see below), whose sum is σ = 16811630896320. Its totient is φ = 6922602086400.
The previous prime is 11002000011949. The next prime is 11002000012013. The reversal of 11002000012011 is 11021000020011.
It is a happy number.
It is not a de Polignac number, because 11002000012011 - 27 = 11002000011883 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 = 11002000011984 and 11002000012002.
It is not an unprimeable number, because it can be changed into a prime (11002000012013) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5470908996 + ... + 5470911006.
It is an arithmetic number, because the mean of its divisors is an integer number (175121155170).
Almost surely, 211002000012011 is an apocalyptic number.
11002000012011 is a deficient number, since it is larger than the sum of its proper divisors (5809630884309).
11002000012011 is a wasteful number, since it uses less digits than its factorization.
11002000012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3357 (or 3354 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11002000012011 its reverse (11021000020011), we get a palindrome (22023000032022).
The spelling of 11002000012011 in words is "eleven trillion, two billion, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •