Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1101111001110110011101 |
3 | 1102221200202122101021111122 |
4 | 2200011210231321312131 |
5 | 2420220223324000333 |
6 | 35221500325500325 |
7 | 2213542352423201 |
oct | 240054455716635 |
9 | 42850678337448 |
10 | 11001101000093 |
11 | 35615a4797646 |
12 | 12981065716a5 |
13 | 61a526564cb9 |
14 | 2a0655894b01 |
15 | 14126d18b798 |
hex | a0164b79d9d |
11001101000093 has 4 divisors (see below), whose sum is σ = 11001271669248. Its totient is φ = 11000930330940.
The previous prime is 11001101000023. The next prime is 11001101000119. The reversal of 11001101000093 is 39000010110011.
11001101000093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11001101000093 - 240 = 9901589372317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001101000023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85237853 + ... + 85366818.
It is an arithmetic number, because the mean of its divisors is an integer number (2750317917312).
Almost surely, 211001101000093 is an apocalyptic number.
It is an amenable number.
11001101000093 is a deficient number, since it is larger than the sum of its proper divisors (170669155).
11001101000093 is an equidigital number, since it uses as much as digits as its factorization.
11001101000093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170669154.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 11001101000093 in words is "eleven trillion, one billion, one hundred one million, ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •