Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …111100111100101000010011 |
3 | 112102211110121222100211120000 |
4 | 121002022231330330220103 |
5 | 103412340011141213021 |
6 | 1030055143050421043 |
7 | 32122320236400342 |
oct | 3102125574745023 |
9 | 472743558324500 |
10 | 110100110101011 |
11 | 32099215936868 |
12 | 10422180131783 |
13 | 495851b850214 |
14 | 1d28c33861b59 |
15 | cade53449b26 |
hex | 6422adf3ca13 |
110100110101011 has 20 divisors (see below), whose sum is σ = 165331637142144. Its totient is φ = 73015779812400.
The previous prime is 110100110100991. The next prime is 110100110101021. The reversal of 110100110101011 is 110101011001011.
It is not a de Polignac number, because 110100110101011 - 215 = 110100110068243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 110100110100984 and 110100110101002.
It is not an unprimeable number, because it can be changed into a prime (110100110101021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3558258400 + ... + 3558289341.
Almost surely, 2110100110101011 is an apocalyptic number.
110100110101011 is a deficient number, since it is larger than the sum of its proper divisors (55231527041133).
110100110101011 is an equidigital number, since it uses as much as digits as its factorization.
110100110101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7116547944 (or 7116547935 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 110100110101011 its reverse (110101011001011), we get a palindrome (220201121102022).
The spelling of 110100110101011 in words is "one hundred ten trillion, one hundred billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •