Base | Representation |
---|---|
bin | 11001000011110010000101… |
… | …100010000011011011001011 |
3 | 112110020002010010112101110012 |
4 | 121003302011202003123023 |
5 | 103421144313341041021 |
6 | 1030222140401142135 |
7 | 32133326553412604 |
oct | 3103620542033313 |
9 | 473202103471405 |
10 | 110211101112011 |
11 | 321312a1420129 |
12 | 1043b79692a94b |
13 | 4965b2945a963 |
14 | 1d303624d2dab |
15 | cb1c9c54a35b |
hex | 643c858836cb |
110211101112011 has 4 divisors (see below), whose sum is σ = 111302300133024. Its totient is φ = 109119902091000.
The previous prime is 110211101112001. The next prime is 110211101112097.
110211101112011 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110211101112011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110211101112001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 545599510355 + ... + 545599510556.
It is an arithmetic number, because the mean of its divisors is an integer number (27825575033256).
Almost surely, 2110211101112011 is an apocalyptic number.
110211101112011 is a deficient number, since it is larger than the sum of its proper divisors (1091199021013).
110211101112011 is a wasteful number, since it uses less digits than its factorization.
110211101112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091199021012.
The product of its (nonzero) digits is 4, while the sum is 14.
It can be divided in two parts, 11021110 and 1112011, that added together give a palindrome (12133121).
The spelling of 110211101112011 in words is "one hundred ten trillion, two hundred eleven billion, one hundred one million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •