Base | Representation |
---|---|
bin | 10000000000011101101… |
… | …101001011100110000011 |
3 | 10220011022120220101020221 |
4 | 100000131231023212003 |
5 | 121010310030323021 |
6 | 2201200532043511 |
7 | 142321162551112 |
oct | 20003555134603 |
9 | 3804276811227 |
10 | 1100010011011 |
11 | 394569a7945a |
12 | 159233163597 |
13 | 7c965ba1b52 |
14 | 3b352951c79 |
15 | 1d9317cc241 |
hex | 1001db4b983 |
1100010011011 has 4 divisors (see below), whose sum is σ = 1101561506800. Its totient is φ = 1098458515224.
The previous prime is 1100010010999. The next prime is 1100010011021. The reversal of 1100010011011 is 1101100100011.
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 1100010011011 - 211 = 1100010008963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100010010985 and 1100010011003.
It is not an unprimeable number, because it can be changed into a prime (1100010011021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 775746831 + ... + 775748248.
It is an arithmetic number, because the mean of its divisors is an integer number (275390376700).
Almost surely, 21100010011011 is an apocalyptic number.
1100010011011 is a deficient number, since it is larger than the sum of its proper divisors (1551495789).
1100010011011 is an equidigital number, since it uses as much as digits as its factorization.
1100010011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1551495788.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100010011011 its reverse (1101100100011), we get a palindrome (2201110111022).
The spelling of 1100010011011 in words is "one trillion, one hundred billion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •