Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000010111100100000101101 |
3 | 112102211110101001220111101000 |
4 | 121002022220002330200231 |
5 | 103412334310304310333 |
6 | 1030055125150510513 |
7 | 32122314624212466 |
oct | 3102125002744055 |
9 | 472743331814330 |
10 | 110100011010093 |
11 | 32099174a06345 |
12 | 10422152b05439 |
13 | 4958504167440 |
14 | 1d28c24629d6d |
15 | cade498c4713 |
hex | 6422a80bc82d |
110100011010093 has 32 divisors (see below), whose sum is σ = 178635393820800. Its totient is φ = 66605482528128.
The previous prime is 110100011010083. The next prime is 110100011010103. The reversal of 110100011010093 is 390010110001011.
It is an interprime number because it is at equal distance from previous prime (110100011010083) and next prime (110100011010103).
It is not a de Polignac number, because 110100011010093 - 28 = 110100011009837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100011010023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2658244080 + ... + 2658285497.
It is an arithmetic number, because the mean of its divisors is an integer number (5582356056900).
Almost surely, 2110100011010093 is an apocalyptic number.
110100011010093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110100011010093 is a deficient number, since it is larger than the sum of its proper divisors (68535382810707).
110100011010093 is a wasteful number, since it uses less digits than its factorization.
110100011010093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5316529658 (or 5316529652 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 110100011010093 in words is "one hundred ten trillion, one hundred billion, eleven million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •