Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …010110011010110011110011 |
3 | 112102211110121021100200221221 |
4 | 121002022231112122303303 |
5 | 103412340001100013021 |
6 | 1030055142050125511 |
7 | 32122320054503311 |
oct | 3102125526326363 |
9 | 472743537320857 |
10 | 110100100001011 |
11 | 3209921016855a |
12 | 10422178880897 |
13 | 4958519724ca3 |
14 | 1d28c323930b1 |
15 | cade52602241 |
hex | 6422ad59acf3 |
110100100001011 has 4 divisors (see below), whose sum is σ = 110556946889224. Its totient is φ = 109643253112800.
The previous prime is 110100100001009. The next prime is 110100100001039. The reversal of 110100100001011 is 110100001001011.
It is a happy number.
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 110100100001011 - 21 = 110100100001009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110100100000985 and 110100100001003.
It is not an unprimeable number, because it can be changed into a prime (110100100001071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 228423443745 + ... + 228423444226.
It is an arithmetic number, because the mean of its divisors is an integer number (27639236722306).
Almost surely, 2110100100001011 is an apocalyptic number.
110100100001011 is a deficient number, since it is larger than the sum of its proper divisors (456846888213).
110100100001011 is an equidigital number, since it uses as much as digits as its factorization.
110100100001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456846888212.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110100100001011 its reverse (110100001001011), we get a palindrome (220200101002022).
The spelling of 110100100001011 in words is "one hundred ten trillion, one hundred billion, one hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •