Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0110001000001110011101 |
3 | 1110101021100022120211001000 |
4 | 2201312112312020032131 |
5 | 2424211231440214323 |
6 | 35353245121140513 |
7 | 2225360340332406 |
oct | 241662666101635 |
9 | 43337308524030 |
10 | 11122201101213 |
11 | 35a8998625a44 |
12 | 12b768278a739 |
13 | 628a85637077 |
14 | 2a6462d649ad |
15 | 1444a99e7e43 |
hex | a1d96d8839d |
11122201101213 has 24 divisors (see below), whose sum is σ = 17390206723200. Its totient is φ = 7024548057768.
The previous prime is 11122201101181. The next prime is 11122201101227. The reversal of 11122201101213 is 31210110222111.
It is a happy number.
11122201101213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11122201101213 - 25 = 11122201101181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122201103213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 570535093 + ... + 570554586.
It is an arithmetic number, because the mean of its divisors is an integer number (724591946800).
Almost surely, 211122201101213 is an apocalyptic number.
It is an amenable number.
11122201101213 is a deficient number, since it is larger than the sum of its proper divisors (6268005621987).
11122201101213 is a wasteful number, since it uses less digits than its factorization.
11122201101213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1141089726 (or 1141089701 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 11122201101213 its reverse (31210110222111), we get a palindrome (42332311323324).
The spelling of 11122201101213 in words is "eleven trillion, one hundred twenty-two billion, two hundred one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •