Base | Representation |
---|---|
bin | 11001000010001011101001… |
… | …100011010011010010000100 |
3 | 112102211120012122212112012202 |
4 | 121002023221203103102010 |
5 | 103412344033130323022 |
6 | 1030055430210134032 |
7 | 32122354100445011 |
oct | 3102135143232204 |
9 | 472746178775182 |
10 | 110101110011012 |
11 | 320996892a8a6a |
12 | 104223bab81318 |
13 | 495864aa58443 |
14 | 1d28cca588708 |
15 | cadeb110e592 |
hex | 6422e98d3484 |
110101110011012 has 12 divisors (see below), whose sum is σ = 192775700576256. Its totient is φ = 55022338417800.
The previous prime is 110101110010979. The next prime is 110101110011131. The reversal of 110101110011012 is 210110011101011.
It is a happy number.
It is a super-2 number, since 2×1101011100110122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110101110010984 and 110101110011002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7054138148 + ... + 7054153755.
It is an arithmetic number, because the mean of its divisors is an integer number (16064641714688).
Almost surely, 2110101110011012 is an apocalyptic number.
It is an amenable number.
110101110011012 is a deficient number, since it is larger than the sum of its proper divisors (82674590565244).
110101110011012 is a wasteful number, since it uses less digits than its factorization.
110101110011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14108293858 (or 14108293856 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 110101110011012 its reverse (210110011101011), we get a palindrome (320211121112023).
The spelling of 110101110011012 in words is "one hundred ten trillion, one hundred one billion, one hundred ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •