Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …011101101000010011001011 |
3 | 112102212102102021012210002110 |
4 | 121002110001131220103023 |
5 | 103413020441341041021 |
6 | 1030103514312433403 |
7 | 32123122644523320 |
oct | 3102240135502313 |
9 | 472772367183073 |
10 | 110110101112011 |
11 | 320a2482571250 |
12 | 104240aa0a8863 |
13 | 4959451711050 |
14 | 1d29500724b47 |
15 | cae33a62e476 |
hex | 6425017684cb |
110110101112011 has 128 divisors (see below), whose sum is σ = 204452207511552. Its totient is φ = 50864371200000.
The previous prime is 110110101111991. The next prime is 110110101112013. The reversal of 110110101112011 is 110211101011011.
It is not a de Polignac number, because 110110101112011 - 27 = 110110101111883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110110101112013) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 6316311 + ... + 16128111.
It is an arithmetic number, because the mean of its divisors is an integer number (1597282871184).
Almost surely, 2110110101112011 is an apocalyptic number.
110110101112011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110110101112011 is a deficient number, since it is larger than the sum of its proper divisors (94342106399541).
110110101112011 is a wasteful number, since it uses less digits than its factorization.
110110101112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9811973.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 110110101112011 its reverse (110211101011011), we get a palindrome (220321202123022).
The spelling of 110110101112011 in words is "one hundred ten trillion, one hundred ten billion, one hundred one million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •