Base | Representation |
---|---|
bin | 11001000010010011111100… |
… | …000010011100110100010011 |
3 | 112102212102011220221221110200 |
4 | 121002103330002130310103 |
5 | 103413020300041213021 |
6 | 1030103501302030243 |
7 | 32123120461120164 |
oct | 3102237402346423 |
9 | 472772156857420 |
10 | 110110010101011 |
11 | 320a243615a348 |
12 | 10424083718383 |
13 | 49594388c6b9b |
14 | 1d294d25d376b |
15 | cae332653126 |
hex | 6424fc09cd13 |
110110010101011 has 12 divisors (see below), whose sum is σ = 159748443438792. Its totient is φ = 73083295983456.
The previous prime is 110110010100997. The next prime is 110110010101033. The reversal of 110110010101011 is 110101010011011.
It is not a de Polignac number, because 110110010101011 - 221 = 110110008003859 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110110010100984 and 110110010101002.
It is not an unprimeable number, because it can be changed into a prime (110110010100011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26948115946 + ... + 26948120031.
It is an arithmetic number, because the mean of its divisors is an integer number (13312370286566).
Almost surely, 2110110010101011 is an apocalyptic number.
110110010101011 is a deficient number, since it is larger than the sum of its proper divisors (49638433337781).
110110010101011 is a wasteful number, since it uses less digits than its factorization.
110110010101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53896236210 (or 53896236207 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 110110010101011 its reverse (110101010011011), we get a palindrome (220211020112022).
The spelling of 110110010101011 in words is "one hundred ten trillion, one hundred ten billion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •