Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1101011110001110001011 |
3 | 1102222112201220200021112122 |
4 | 2200031313031132032023 |
5 | 2420341440301400021 |
6 | 35225531424001455 |
7 | 2214306044034002 |
oct | 240156715361613 |
9 | 42875656607478 |
10 | 11010001200011 |
11 | 3565351713570 |
12 | 129998b16028b |
13 | 61b314441798 |
14 | 2a0c5b92bc39 |
15 | 1415de702bab |
hex | a037735e38b |
11010001200011 has 32 divisors (see below), whose sum is σ = 12851925281280. Its totient is φ = 9325690099200.
The previous prime is 11010001200001. The next prime is 11010001200017. The reversal of 11010001200011 is 11000210001011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11010001200011 - 242 = 6611954688907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010001200017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111542666 + ... + 111641328.
It is an arithmetic number, because the mean of its divisors is an integer number (401622665040).
Almost surely, 211010001200011 is an apocalyptic number.
11010001200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11010001200011 is a deficient number, since it is larger than the sum of its proper divisors (1841924081269).
11010001200011 is a wasteful number, since it uses less digits than its factorization.
11010001200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107507.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11010001200011 its reverse (11000210001011), we get a palindrome (22010211201022).
The spelling of 11010001200011 in words is "eleven trillion, ten billion, one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •