Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001100010011010010110101 |
3 | 112102110222211121010112210002 |
4 | 121000232123030103102311 |
5 | 103404224032321023333 |
6 | 1025541433351241045 |
7 | 32112211413025364 |
oct | 3100563314232265 |
9 | 472428747115702 |
10 | 110001011111093 |
11 | 320601920629a3 |
12 | 10406b24079185 |
13 | 494c0878cbb4b |
14 | 1d241123417db |
15 | cab5a338b0e8 |
hex | 640b9b3134b5 |
110001011111093 has 8 divisors (see below), whose sum is σ = 112085888387256. Its totient is φ = 107916481483200.
The previous prime is 110001011111087. The next prime is 110001011111113. The reversal of 110001011111093 is 390111110100011.
It can be written as a sum of positive squares in 4 ways, for example, as 7614277322404 + 102386733788689 = 2759398^2 + 10118633^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110001011111093 - 224 = 110000994333877 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110001011111053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86273198 + ... + 87538943.
It is an arithmetic number, because the mean of its divisors is an integer number (14010736048407).
Almost surely, 2110001011111093 is an apocalyptic number.
It is an amenable number.
110001011111093 is a deficient number, since it is larger than the sum of its proper divisors (2084877276163).
110001011111093 is a wasteful number, since it uses less digits than its factorization.
110001011111093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173824135.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 110001011111093 in words is "one hundred ten trillion, one billion, eleven million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •