Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0110001100110111010011 |
3 | 1110101021100022121210002122 |
4 | 2201312112312030313103 |
5 | 2424211231441321321 |
6 | 35353245121404455 |
7 | 2225360340441656 |
oct | 241662666146723 |
9 | 43337308553078 |
10 | 11122201120211 |
11 | 35a8998639245 |
12 | 12b768279972b |
13 | 628a856428cc |
14 | 2a6462d6b89d |
15 | 1444a99ed8ab |
hex | a1d96d8cdd3 |
11122201120211 has 8 divisors (see below), whose sum is σ = 11581922157600. Its totient is φ = 10667559873600.
The previous prime is 11122201120139. The next prime is 11122201120241. The reversal of 11122201120211 is 11202110222111.
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-11122201120211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11122201120211.
It is not an unprimeable number, because it can be changed into a prime (11122201120241) 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, 1269943226 + ... + 1269951983.
It is an arithmetic number, because the mean of its divisors is an integer number (1447740269700).
Almost surely, 211122201120211 is an apocalyptic number.
11122201120211 is a deficient number, since it is larger than the sum of its proper divisors (459721037389).
11122201120211 is a wasteful number, since it uses less digits than its factorization.
11122201120211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2539895389.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11122201120211 its reverse (11202110222111), we get a palindrome (22324311342322).
The spelling of 11122201120211 in words is "eleven trillion, one hundred twenty-two billion, two hundred one million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •