Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0110010110111111111101 |
3 | 1110022020220121002200210122 |
4 | 2201202231312112333331 |
5 | 2423340034210414323 |
6 | 35335440332544325 |
7 | 2224012623543056 |
oct | 241425566267775 |
9 | 43266817080718 |
10 | 11101112201213 |
11 | 359aa56483271 |
12 | 12b35780220a5 |
13 | 626aa4496c08 |
14 | 2a54221cd72d |
15 | 143b73389ec8 |
hex | a18add96ffd |
11101112201213 has 2 divisors, whose sum is σ = 11101112201214. Its totient is φ = 11101112201212.
The previous prime is 11101112201191. The next prime is 11101112201219. The reversal of 11101112201213 is 31210221110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6982980656089 + 4118131545124 = 2642533^2 + 2029318^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101112201213 - 26 = 11101112201149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101112201191 and 11101112201200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101112201219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550556100606 + 5550556100607.
It is an arithmetic number, because the mean of its divisors is an integer number (5550556100607).
Almost surely, 211101112201213 is an apocalyptic number.
It is an amenable number.
11101112201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101112201213 is an equidigital number, since it uses as much as digits as its factorization.
11101112201213 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 11101112201213 its reverse (31210221110111), we get a palindrome (42311333311324).
The spelling of 11101112201213 in words is "eleven trillion, one hundred one billion, one hundred twelve million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •