Base | Representation |
---|---|
bin | 110011001111001011… |
… | …1011000000010100111 |
3 | 101112000020221112200211 |
4 | 1212132113120002213 |
5 | 3300320431012221 |
6 | 122314140320251 |
7 | 10643450002033 |
oct | 1463627300247 |
9 | 345006845624 |
10 | 110031110311 |
11 | 42733769811 |
12 | 193a9243087 |
13 | a4b6aa0385 |
14 | 547b3a11c3 |
15 | 2cdebe06e1 |
hex | 199e5d80a7 |
110031110311 has 4 divisors (see below), whose sum is σ = 115822221400. Its totient is φ = 104239999224.
The previous prime is 110031110303. The next prime is 110031110317. The reversal of 110031110311 is 113011130011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110031110311 - 23 = 110031110303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110031110291 and 110031110300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110031110317) 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 3 ways as a sum of consecutive naturals, for example, 2895555516 + ... + 2895555553.
It is an arithmetic number, because the mean of its divisors is an integer number (28955555350).
Almost surely, 2110031110311 is an apocalyptic number.
110031110311 is a deficient number, since it is larger than the sum of its proper divisors (5791111089).
110031110311 is an equidigital number, since it uses as much as digits as its factorization.
110031110311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5791111088.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 110031110311 its reverse (113011130011), we get a palindrome (223042240322).
The spelling of 110031110311 in words is "one hundred ten billion, thirty-one million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •