Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1011010101100000111001 |
3 | 1102222122211110211100102002 |
4 | 2200032332223111200321 |
5 | 2420401414223223001 |
6 | 35230250414550345 |
7 | 2214350543332604 |
oct | 240167653254071 |
9 | 42878743740362 |
10 | 11011200211001 |
11 | 3565907504241 |
12 | 129a0648083b5 |
13 | 61b47597aa43 |
14 | 2a0d32c8133b |
15 | 14165eae546b |
hex | a03bead5839 |
11011200211001 has 8 divisors (see below), whose sum is σ = 11021405372160. Its totient is φ = 11000995454592.
The previous prime is 11011200210977. The next prime is 11011200211031. The reversal of 11011200211001 is 10011200211011.
11011200211001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011200211001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011200211031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97679396 + ... + 97792058.
It is an arithmetic number, because the mean of its divisors is an integer number (1377675671520).
Almost surely, 211011200211001 is an apocalyptic number.
It is an amenable number.
11011200211001 is a deficient number, since it is larger than the sum of its proper divisors (10205161159).
11011200211001 is a wasteful number, since it uses less digits than its factorization.
11011200211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202375.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011200211001 its reverse (10011200211011), we get a palindrome (21022400422012).
The spelling of 11011200211001 in words is "eleven trillion, eleven billion, two hundred million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •