Base | Representation |
---|---|
bin | 11001000011110010000101… |
… | …101010011100110011101011 |
3 | 112110020002010021200012211011 |
4 | 121003302011222130303223 |
5 | 103421144314422010011 |
6 | 1030222140520244351 |
7 | 32133326611211062 |
oct | 3103620552346353 |
9 | 473202107605734 |
10 | 110211103313131 |
11 | 321312a2693937 |
12 | 1043b7976106b7 |
13 | 4965b29a4b7b2 |
14 | 1d303629071d9 |
15 | cb1c9c832621 |
hex | 643c85a9cceb |
110211103313131 has 8 divisors (see below), whose sum is σ = 116988049219680. Its totient is φ = 103466817387648.
The previous prime is 110211103313123. The next prime is 110211103313243. The reversal of 110211103313131 is 131313301112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110211103313131 - 23 = 110211103313123 is a prime.
It is a super-2 number, since 2×1102111033131312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110211103313111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8164988311 + ... + 8165001808.
It is an arithmetic number, because the mean of its divisors is an integer number (14623506152460).
Almost surely, 2110211103313131 is an apocalyptic number.
110211103313131 is a deficient number, since it is larger than the sum of its proper divisors (6776945906549).
110211103313131 is a wasteful number, since it uses less digits than its factorization.
110211103313131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16329990533.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 110211103313131 its reverse (131313301112011), we get a palindrome (241524404425142).
The spelling of 110211103313131 in words is "one hundred ten trillion, two hundred eleven billion, one hundred three million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •