Base | Representation |
---|---|
bin | 1010000001011100101100… |
… | …1100101000010101001011 |
3 | 1110000111112202120002220222 |
4 | 2200113023030220111023 |
5 | 2421022430022400021 |
6 | 35234303533140255 |
7 | 2215111610112335 |
oct | 240271314502513 |
9 | 43014482502828 |
10 | 11020000200011 |
11 | 3569612905230 |
12 | 129b8bb92a68b |
13 | 61c248b6ba2a |
14 | 2a15298b0455 |
15 | 1419c74646ab |
hex | a05cb32854b |
11020000200011 has 16 divisors (see below), whose sum is σ = 12733477911648. Its totient is φ = 9425548492800.
The previous prime is 11020000199987. The next prime is 11020000200023. The reversal of 11020000200011 is 11000200002011.
It is not a de Polignac number, because 11020000200011 - 26 = 11020000199947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020000208011) 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 15 ways as a sum of consecutive naturals, for example, 9870950 + ... + 10930491.
It is an arithmetic number, because the mean of its divisors is an integer number (795842369478).
Almost surely, 211020000200011 is an apocalyptic number.
11020000200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11020000200011 is a deficient number, since it is larger than the sum of its proper divisors (1713477711637).
11020000200011 is a wasteful number, since it uses less digits than its factorization.
11020000200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20804302.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11020000200011 its reverse (11000200002011), we get a palindrome (22020200202022).
It can be divided in two parts, 110200002000 and 11, that added together give a palindrome (110200002011).
The spelling of 11020000200011 in words is "eleven trillion, twenty billion, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •