Base | Representation |
---|---|
bin | 11001000000110111110101… |
… | …001000100000100111000101 |
3 | 112102111221220101222022111001 |
4 | 121000313311020200213011 |
5 | 103404410223130013333 |
6 | 1025550223425413301 |
7 | 32113016601130360 |
oct | 3100676510404705 |
9 | 472457811868431 |
10 | 110011110001093 |
11 | 320644a4680484 |
12 | 10408a8219a231 |
13 | 4950006c317c2 |
14 | 1d247cd6870d7 |
15 | cab994c7eb7d |
hex | 640df52209c5 |
110011110001093 has 16 divisors (see below), whose sum is σ = 126412332674560. Its totient is φ = 93781487010816.
The previous prime is 110011110001087. The next prime is 110011110001097. The reversal of 110011110001093 is 390100011110011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110011110001093 - 233 = 110002520066501 is a prime.
It is a super-2 number, since 2×1100111100010932 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110011110001093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011110001097) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5889078 + ... + 15959431.
It is an arithmetic number, because the mean of its divisors is an integer number (7900770792160).
Almost surely, 2110011110001093 is an apocalyptic number.
It is an amenable number.
110011110001093 is a deficient number, since it is larger than the sum of its proper divisors (16401222673467).
110011110001093 is a wasteful number, since it uses less digits than its factorization.
110011110001093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21852436.
The product of its (nonzero) digits is 27, while the sum is 19.
The spelling of 110011110001093 in words is "one hundred ten trillion, eleven billion, one hundred ten million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •