Base | Representation |
---|---|
bin | 1010000110001010111001… |
… | …0100111010100100010101 |
3 | 1110022020221011011122110121 |
4 | 2201202232110322210111 |
5 | 2423340043233224341 |
6 | 35335441220351541 |
7 | 2224013051613625 |
oct | 241425624724425 |
9 | 43266834148417 |
10 | 11101120211221 |
11 | 359aa5aa54307 |
12 | 12b357a8455b1 |
13 | 626aa603ca71 |
14 | 2a54232b6885 |
15 | 143b73e1d4d1 |
hex | a18ae53a915 |
11101120211221 has 2 divisors, whose sum is σ = 11101120211222. Its totient is φ = 11101120211220.
The previous prime is 11101120211177. The next prime is 11101120211239. The reversal of 11101120211221 is 12211202110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10997918648721 + 103201562500 = 3316311^2 + 321250^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101120211221 - 29 = 11101120210709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101120211195 and 11101120211204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101120211261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550560105610 + 5550560105611.
It is an arithmetic number, because the mean of its divisors is an integer number (5550560105611).
Almost surely, 211101120211221 is an apocalyptic number.
It is an amenable number.
11101120211221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101120211221 is an equidigital number, since it uses as much as digits as its factorization.
11101120211221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11101120211221 its reverse (12211202110111), we get a palindrome (23312322321332).
The spelling of 11101120211221 in words is "eleven trillion, one hundred one billion, one hundred twenty million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.250 sec. • engine limits •