Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001100010111101000011 |
3 | 10220020212122122101200122 |
4 | 100001120301202331003 |
5 | 121014322224323021 |
6 | 2201443132410455 |
7 | 142354555115666 |
oct | 20013061427503 |
9 | 3806778571618 |
10 | 1101001011011 |
11 | 394a28405420 |
12 | 15946b016a2b |
13 | 7ca932aa695 |
14 | 3b4083d96dd |
15 | 1d98d7d1bab |
hex | 10058c62f43 |
1101001011011 has 8 divisors (see below), whose sum is σ = 1203388561344. Its totient is φ = 998996218920.
The previous prime is 1101001010983. The next prime is 1101001011041. The reversal of 1101001011011 is 1101101001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101001011011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1101001011011.
It is not an unprimeable number, because it can be changed into a prime (1101001011041) 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, 95683541 + ... + 95695046.
It is an arithmetic number, because the mean of its divisors is an integer number (150423570168).
Almost surely, 21101001011011 is an apocalyptic number.
1101001011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1101001011011 is a deficient number, since it is larger than the sum of its proper divisors (102387550333).
1101001011011 is a wasteful number, since it uses less digits than its factorization.
1101001011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191379121.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1101001011011 its reverse (1101101001011), we get a palindrome (2202102012022).
The spelling of 1101001011011 in words is "one trillion, one hundred one billion, one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •