Base | Representation |
---|---|
bin | 100000000001111011110… |
… | …110000000100001000011 |
3 | 21210102102111212200122002 |
4 | 200001323312000201003 |
5 | 242030323324323021 |
6 | 4403101041334215 |
7 | 315011222615510 |
oct | 40017366004103 |
9 | 7712374780562 |
10 | 2201101011011 |
11 | 779533157941 |
12 | 2b670833736b |
13 | 12c7419c9446 |
14 | 78768c94307 |
15 | 3c3c7e3750b |
hex | 2007bd80843 |
2201101011011 has 8 divisors (see below), whose sum is σ = 2624915491584. Its totient is φ = 1804629400200.
The previous prime is 2201101010971. The next prime is 2201101011019. The reversal of 2201101011011 is 1101101011022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2201101011011 - 26 = 2201101010947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201101010983 and 2201101011001.
It is not an unprimeable number, because it can be changed into a prime (2201101011019) 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, 6835717265 + ... + 6835717586.
It is an arithmetic number, because the mean of its divisors is an integer number (328114436448).
Almost surely, 22201101011011 is an apocalyptic number.
2201101011011 is a deficient number, since it is larger than the sum of its proper divisors (423814480573).
2201101011011 is a wasteful number, since it uses less digits than its factorization.
2201101011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13671434881.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2201101011011 its sum of digits (11), we get a palindrome (2201101011022).
Adding to 2201101011011 its reverse (1101101011022), we get a palindrome (3302202022033).
The spelling of 2201101011011 in words is "two trillion, two hundred one billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •