Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1101000110000100100101 |
3 | 1102222112201220111020212000 |
4 | 2200031313031012010211 |
5 | 2420341440240213333 |
6 | 35225531421515513 |
7 | 2214306043142421 |
oct | 240156715060445 |
9 | 42875656436760 |
10 | 11010001101093 |
11 | 3565351656215 |
12 | 129998b112b99 |
13 | 61b314408757 |
14 | 2a0c5b903b81 |
15 | 1415de6d3713 |
hex | a0377346125 |
11010001101093 has 8 divisors (see below), whose sum is σ = 16311112742400. Its totient is φ = 7340000734044.
The previous prime is 11010001101091. The next prime is 11010001101139. The reversal of 11010001101093 is 39010110001011.
It is not a de Polignac number, because 11010001101093 - 21 = 11010001101091 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010001101091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203888909253 + ... + 203888909306.
It is an arithmetic number, because the mean of its divisors is an integer number (2038889092800).
Almost surely, 211010001101093 is an apocalyptic number.
It is an amenable number.
11010001101093 is a deficient number, since it is larger than the sum of its proper divisors (5301111641307).
11010001101093 is an equidigital number, since it uses as much as digits as its factorization.
11010001101093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407777818568 (or 407777818562 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 11010001101093 in words is "eleven trillion, ten billion, one million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •