Base | Representation |
---|---|
bin | 11001000010010011111011… |
… | …011011111010111111110011 |
3 | 112102212102011012221210212121 |
4 | 121002103323123322333303 |
5 | 103413020240000013021 |
6 | 1030103500301335111 |
7 | 32123120306223133 |
oct | 3102237333727763 |
9 | 472772135853777 |
10 | 110110000001011 |
11 | 320a243049103a |
12 | 10424080267497 |
13 | 495943679b95a |
14 | 1d294d1124ac3 |
15 | cae33180a741 |
hex | 6424fb6faff3 |
110110000001011 has 8 divisors (see below), whose sum is σ = 114022773384480. Its totient is φ = 106204951739712.
The previous prime is 110110000001009. The next prime is 110110000001021. The reversal of 110110000001011 is 110100000011011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110110000001011 - 21 = 110110000001009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110110000000985 and 110110000001003.
It is not an unprimeable number, because it can be changed into a prime (110110000001021) 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, 1931251530 + ... + 1931308543.
It is an arithmetic number, because the mean of its divisors is an integer number (14252846673060).
Almost surely, 2110110000001011 is an apocalyptic number.
110110000001011 is a deficient number, since it is larger than the sum of its proper divisors (3912773383469).
110110000001011 is an equidigital number, since it uses as much as digits as its factorization.
110110000001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3862561085.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110110000001011 its reverse (110100000011011), we get a palindrome (220210000012022).
The spelling of 110110000001011 in words is "one hundred ten trillion, one hundred ten billion, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •