Base | Representation |
---|---|
bin | 1010000111010100111111… |
… | …1011000101111001101001 |
3 | 1110101011021101121120222011 |
4 | 2201311033323011321221 |
5 | 2424201312333020243 |
6 | 35352531053555521 |
7 | 2225316011450236 |
oct | 241651773057151 |
9 | 43334241546864 |
10 | 11121011220073 |
11 | 35a8437a006a7 |
12 | 12b73b01a5ba1 |
13 | 628925c765a1 |
14 | 2a638cd0a78d |
15 | 14443a30a89d |
hex | a1d4fec5e69 |
11121011220073 has 2 divisors, whose sum is σ = 11121011220074. Its totient is φ = 11121011220072.
The previous prime is 11121011220071. The next prime is 11121011220091. The reversal of 11121011220073 is 37002211012111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9923930151529 + 1197081068544 = 3150227^2 + 1094112^2 .
It is an emirp because it is prime and its reverse (37002211012111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11121011220073 - 21 = 11121011220071 is a prime.
Together with 11121011220071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11121011220071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560505610036 + 5560505610037.
It is an arithmetic number, because the mean of its divisors is an integer number (5560505610037).
Almost surely, 211121011220073 is an apocalyptic number.
It is an amenable number.
11121011220073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121011220073 is an equidigital number, since it uses as much as digits as its factorization.
11121011220073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 11121011220073 its reverse (37002211012111), we get a palindrome (48123222232184).
The spelling of 11121011220073 in words is "eleven trillion, one hundred twenty-one billion, eleven million, two hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •