Base | Representation |
---|---|
bin | 1010001101001101100111… |
… | …1000101101111001111001 |
3 | 1110201211020010222212121122 |
4 | 2203103121320231321321 |
5 | 2432330340141213423 |
6 | 35511211033515025 |
7 | 2235525230661452 |
oct | 243233170557171 |
9 | 43654203885548 |
10 | 11222110101113 |
11 | 36372a765734a |
12 | 1312b05b72a75 |
13 | 6353183345a2 |
14 | 2ab21dc98129 |
15 | 146da5c598c8 |
hex | a34d9e2de79 |
11222110101113 has 2 divisors, whose sum is σ = 11222110101114. Its totient is φ = 11222110101112.
The previous prime is 11222110101061. The next prime is 11222110101121. The reversal of 11222110101113 is 31110101122211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10867551780409 + 354558320704 = 3296597^2 + 595448^2 .
It is a cyclic number.
It is not a de Polignac number, because 11222110101113 - 28 = 11222110100857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11222110101091 and 11222110101100.
It is not a weakly prime, because it can be changed into another prime (11222110101133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5611055050556 + 5611055050557.
It is an arithmetic number, because the mean of its divisors is an integer number (5611055050557).
Almost surely, 211222110101113 is an apocalyptic number.
It is an amenable number.
11222110101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11222110101113 is an equidigital number, since it uses as much as digits as its factorization.
11222110101113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11222110101113 its reverse (31110101122211), we get a palindrome (42332211223324).
The spelling of 11222110101113 in words is "eleven trillion, two hundred twenty-two billion, one hundred ten million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •