Base | Representation |
---|---|
bin | 1010000001100000110011… |
… | …1000100000011100011001 |
3 | 1110000121101120012120122011 |
4 | 2200120030320200130121 |
5 | 2421032204132033311 |
6 | 35235005141225521 |
7 | 2215151121123631 |
oct | 240301470403431 |
9 | 43017346176564 |
10 | 11021102221081 |
11 | 356a02897aa47 |
12 | 129bb68a022a1 |
13 | 61c3932795c4 |
14 | 2a15d1db76c1 |
15 | 141a3e099321 |
hex | a060ce20719 |
11021102221081 has 2 divisors, whose sum is σ = 11021102221082. Its totient is φ = 11021102221080.
The previous prime is 11021102221069. The next prime is 11021102221121. The reversal of 11021102221081 is 18012220112011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10026975571600 + 994126649481 = 3166540^2 + 997059^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021102221081 - 229 = 11020565350169 is a prime.
It is a super-2 number, since 2×110211022210812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11021102221001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510551110540 + 5510551110541.
It is an arithmetic number, because the mean of its divisors is an integer number (5510551110541).
Almost surely, 211021102221081 is an apocalyptic number.
It is an amenable number.
11021102221081 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021102221081 is an equidigital number, since it uses as much as digits as its factorization.
11021102221081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 11021102221081 its reverse (18012220112011), we get a palindrome (29033322333092).
The spelling of 11021102221081 in words is "eleven trillion, twenty-one billion, one hundred two million, two hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •