Base | Representation |
---|---|
bin | 1010001101000110001000… |
… | …1001110111110010100101 |
3 | 1110201122001011010211121112 |
4 | 2203101202021313302211 |
5 | 2432312231420112013 |
6 | 35510235434554405 |
7 | 2235424366505231 |
oct | 243214211676245 |
9 | 43648034124545 |
10 | 11220101332133 |
11 | 36364667704a1 |
12 | 1312645298a05 |
13 | 635088109aa5 |
14 | 2ab0ad1995c1 |
15 | 146cd9713ba8 |
hex | a3462277ca5 |
11220101332133 has 2 divisors, whose sum is σ = 11220101332134. Its totient is φ = 11220101332132.
The previous prime is 11220101332081. The next prime is 11220101332171. The reversal of 11220101332133 is 33123310102211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6604401429409 + 4615699902724 = 2569903^2 + 2148418^2 .
It is a cyclic number.
It is not a de Polignac number, because 11220101332133 - 216 = 11220101266597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11220101332099 and 11220101332108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220301332133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610050666066 + 5610050666067.
It is an arithmetic number, because the mean of its divisors is an integer number (5610050666067).
Almost surely, 211220101332133 is an apocalyptic number.
It is an amenable number.
11220101332133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220101332133 is an equidigital number, since it uses as much as digits as its factorization.
11220101332133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11220101332133 its reverse (33123310102211), we get a palindrome (44343411434344).
The spelling of 11220101332133 in words is "eleven trillion, two hundred twenty billion, one hundred one million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •