Base | Representation |
---|---|
bin | 1010000111010101011010… |
… | …0001110000111011101101 |
3 | 1110101011120010002212101221 |
4 | 2201311112201300323231 |
5 | 2424202024214133401 |
6 | 35352550052503341 |
7 | 2225321525316301 |
oct | 241652641607355 |
9 | 43334503085357 |
10 | 11121122021101 |
11 | 35a84944aa0a4 |
12 | 12b742131ab51 |
13 | 628942bcc421 |
14 | 2a639d90dd01 |
15 | 144444de57a1 |
hex | a1d56870eed |
11121122021101 has 2 divisors, whose sum is σ = 11121122021102. Its totient is φ = 11121122021100.
The previous prime is 11121122021081. The next prime is 11121122021153. The reversal of 11121122021101 is 10112022112111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5812125397225 + 5308996623876 = 2410835^2 + 2304126^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121122021101 - 27 = 11121122020973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121122021171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560561010550 + 5560561010551.
It is an arithmetic number, because the mean of its divisors is an integer number (5560561010551).
Almost surely, 211121122021101 is an apocalyptic number.
It is an amenable number.
11121122021101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121122021101 is an equidigital number, since it uses as much as digits as its factorization.
11121122021101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11121122021101 its reverse (10112022112111), we get a palindrome (21233144133212).
The spelling of 11121122021101 in words is "eleven trillion, one hundred twenty-one billion, one hundred twenty-two million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •