Base | Representation |
---|---|
bin | 110011010001100100… |
… | …1010100010111001111 |
3 | 101112012211212011210020 |
4 | 1212203021110113033 |
5 | 3301001443430221 |
6 | 122330123313223 |
7 | 10645442463141 |
oct | 1464311242717 |
9 | 345184764706 |
10 | 110111311311 |
11 | 42774a67a31 |
12 | 1941007b813 |
13 | a4ca5a10a1 |
14 | 5487cbac91 |
15 | 2ce6c83ac6 |
hex | 19a32545cf |
110111311311 has 8 divisors (see below), whose sum is σ = 146933773104. Its totient is φ = 73348195200.
The previous prime is 110111311253. The next prime is 110111311369. The reversal of 110111311311 is 113113111011.
It is an interprime number because it is at equal distance from previous prime (110111311253) and next prime (110111311369).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110111311311 - 229 = 109574440399 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110111311391) 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 7 ways as a sum of consecutive naturals, for example, 14832090 + ... + 14839511.
It is an arithmetic number, because the mean of its divisors is an integer number (18366721638).
Almost surely, 2110111311311 is an apocalyptic number.
110111311311 is a deficient number, since it is larger than the sum of its proper divisors (36822461793).
110111311311 is a wasteful number, since it uses less digits than its factorization.
110111311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29672841.
The product of its (nonzero) digits is 9, while the sum is 15.
Adding to 110111311311 its reverse (113113111011), we get a palindrome (223224422322).
The spelling of 110111311311 in words is "one hundred ten billion, one hundred eleven million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •