Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1110010010100000100101 |
3 | 1102221200202122120102001101 |
4 | 2200011210232102200211 |
5 | 2420220223340213333 |
6 | 35221500332000101 |
7 | 2213542353323515 |
oct | 240054456224045 |
9 | 42850678512041 |
10 | 11001101101093 |
11 | 35615a4856514 |
12 | 1298106600031 |
13 | 61a52659bc6c |
14 | 2a06558bd845 |
15 | 14126d1ab67d |
hex | a0164b92825 |
11001101101093 has 2 divisors, whose sum is σ = 11001101101094. Its totient is φ = 11001101101092.
The previous prime is 11001101101057. The next prime is 11001101101117. The reversal of 11001101101093 is 39010110110011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10172795428324 + 828305672769 = 3189482^2 + 910113^2 .
It is an emirp because it is prime and its reverse (39010110110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001101101093 - 225 = 11001067546661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001101101093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001101111093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500550550546 + 5500550550547.
It is an arithmetic number, because the mean of its divisors is an integer number (5500550550547).
Almost surely, 211001101101093 is an apocalyptic number.
It is an amenable number.
11001101101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001101101093 is an equidigital number, since it uses as much as digits as its factorization.
11001101101093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 19.
The spelling of 11001101101093 in words is "eleven trillion, one billion, one hundred one million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •