Base | Representation |
---|---|
bin | 11001000000110110110010… |
… | …111110100111001000011110 |
3 | 112102111212001001112000021121 |
4 | 121000312302332213020132 |
5 | 103404400440012010420 |
6 | 1025545521340521154 |
7 | 32112650233200532 |
oct | 3100666276471036 |
9 | 472455031460247 |
10 | 110010000110110 |
11 | 32063a8511aa01 |
12 | 104088125501ba |
13 | 494cb8acc9a89 |
14 | 1d247260d1bc2 |
15 | cab92c5e32aa |
hex | 640db2fa721e |
110010000110110 has 64 divisors (see below), whose sum is σ = 200227140000000. Its totient is φ = 43515772432384.
The previous prime is 110010000110047. The next prime is 110010000110147. The reversal of 110010000110110 is 11011000010011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110010000110093 and 110010000110102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1655522166 + ... + 1655588614.
It is an arithmetic number, because the mean of its divisors is an integer number (3128549062500).
Almost surely, 2110010000110110 is an apocalyptic number.
110010000110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110010000110110 is a deficient number, since it is larger than the sum of its proper divisors (90217139889890).
110010000110110 is a wasteful number, since it uses less digits than its factorization.
110010000110110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71493.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010000110110 its reverse (11011000010011), we get a palindrome (121021000120121).
The spelling of 110010000110110 in words is "one hundred ten trillion, ten billion, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •