Base | Representation |
---|---|
bin | 1010001101000101110011… |
… | …0010000011000111110011 |
3 | 1110201121210212112200221211 |
4 | 2203101130302003013303 |
5 | 2432312040331413021 |
6 | 35510222455100551 |
7 | 2235422223425254 |
oct | 243213462030763 |
9 | 43647725480854 |
10 | 11220011201011 |
11 | 363641a8aa668 |
12 | 131261b071757 |
13 | 635072540272 |
14 | 2ab0a1216b2b |
15 | 146cd185d3e1 |
hex | a345cc831f3 |
11220011201011 has 8 divisors (see below), whose sum is σ = 12396534115104. Its totient is φ = 10100879648640.
The previous prime is 11220011200967. The next prime is 11220011201051. The reversal of 11220011201011 is 11010211002211.
It is a happy number.
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-11220011201011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11220011200982 and 11220011201000.
It is not an unprimeable number, because it can be changed into a prime (11220011201051) 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, 14347840020 + ... + 14347840801.
It is an arithmetic number, because the mean of its divisors is an integer number (1549566764388).
Almost surely, 211220011201011 is an apocalyptic number.
11220011201011 is a deficient number, since it is larger than the sum of its proper divisors (1176522914093).
11220011201011 is a wasteful number, since it uses less digits than its factorization.
11220011201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28695680861.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11220011201011 its reverse (11010211002211), we get a palindrome (22230222203222).
The spelling of 11220011201011 in words is "eleven trillion, two hundred twenty billion, eleven million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •