Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …100011001100110110101110 |
3 | 112102111000001212021101022221 |
4 | 121000232200203030312232 |
5 | 103404224223324000420 |
6 | 1025541450322025554 |
7 | 32112213554046445 |
oct | 3100564043146656 |
9 | 472430055241287 |
10 | 110001101000110 |
11 | 32060228878941 |
12 | 10406b4a1a82ba |
13 | 494c0a0412408 |
14 | 1d2412025dd5c |
15 | cab5ab1e4caa |
hex | 640ba08ccdae |
110001101000110 has 16 divisors (see below), whose sum is σ = 199924331139936. Its totient is φ = 43573251657888.
The previous prime is 110001101000101. The next prime is 110001101000201. The reversal of 110001101000110 is 11000101100011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110001101000093 and 110001101000102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53398591689 + ... + 53398593748.
It is an arithmetic number, because the mean of its divisors is an integer number (12495270696246).
Almost surely, 2110001101000110 is an apocalyptic number.
110001101000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110001101000110 is a deficient number, since it is larger than the sum of its proper divisors (89923230139826).
110001101000110 is a wasteful number, since it uses less digits than its factorization.
110001101000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106797185547.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110001101000110 its reverse (11000101100011), we get a palindrome (121001202100121).
Subtracting from 110001101000110 its reverse (11000101100011), we obtain a palindrome (99000999900099).
The spelling of 110001101000110 in words is "one hundred ten trillion, one billion, one hundred one million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •