Base | Representation |
---|---|
bin | 10100100001110101… |
… | …00010101010001011 |
3 | 1001110002022222012000 |
4 | 22100322202222023 |
5 | 140032411400021 |
6 | 5021342322043 |
7 | 540054440313 |
oct | 122072425213 |
9 | 31402288160 |
10 | 11021200011 |
11 | 47461a8768 |
12 | 2176b89323 |
13 | 106843b033 |
14 | 767a2c443 |
15 | 44787ab26 |
hex | 290ea2a8b |
11021200011 has 64 divisors (see below), whose sum is σ = 18261872640. Its totient is φ = 6536194560.
The previous prime is 11021200009. The next prime is 11021200013. The reversal of 11021200011 is 11000212011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11021200009) and next prime (11021200013).
It is not a de Polignac number, because 11021200011 - 21 = 11021200009 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 = 11021199966 and 11021200002.
It is not an unprimeable number, because it can be changed into a prime (11021200013) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 602841 + ... + 620853.
It is an arithmetic number, because the mean of its divisors is an integer number (285341760).
Almost surely, 211021200011 is an apocalyptic number.
11021200011 is a deficient number, since it is larger than the sum of its proper divisors (7240672629).
11021200011 is a wasteful number, since it uses less digits than its factorization.
11021200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18113 (or 18107 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11021200011 its reverse (11000212011), we get a palindrome (22021412022).
It can be divided in two parts, 110212000 and 11, that added together give a palindrome (110212011).
The spelling of 11021200011 in words is "eleven billion, twenty-one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •