Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0111001101011111100101 |
3 | 1102222122212212020212111011 |
4 | 2200032333313031133211 |
5 | 2420401434321213333 |
6 | 35230252405142221 |
7 | 2214351204363322 |
oct | 240167767153745 |
9 | 42878785225434 |
10 | 11011220101093 |
11 | 3565917759a33 |
12 | 129a06b3ba971 |
13 | 61b479b23124 |
14 | 2a0d3577bb49 |
15 | 1416617239cd |
hex | a03bfdcd7e5 |
11011220101093 has 2 divisors, whose sum is σ = 11011220101094. Its totient is φ = 11011220101092.
The previous prime is 11011220101039. The next prime is 11011220101111. The reversal of 11011220101093 is 39010102211011.
Together with previous prime (11011220101039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6288148033924 + 4723072067169 = 2507618^2 + 2173263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011220101093 is a prime.
It is a super-2 number, since 2×110112201010932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011220101793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505610050546 + 5505610050547.
It is an arithmetic number, because the mean of its divisors is an integer number (5505610050547).
Almost surely, 211011220101093 is an apocalyptic number.
It is an amenable number.
11011220101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011220101093 is an equidigital number, since it uses as much as digits as its factorization.
11011220101093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 11011220101093 in words is "eleven trillion, eleven billion, two hundred twenty million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •