Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …111000010001100000011 |
3 | 10220011021220002022211120 |
4 | 100000131013002030003 |
5 | 121010300000323021 |
6 | 2201155533443323 |
7 | 142321011551436 |
oct | 20003507021403 |
9 | 3804256068746 |
10 | 1100000011011 |
11 | 3945643692a0 |
12 | 15922b940543 |
13 | 7c963ab02a5 |
14 | 3b3514ab81d |
15 | 1d9309a42c6 |
hex | 1001d1c2303 |
1100000011011 has 16 divisors (see below), whose sum is σ = 1600959904128. Its totient is φ = 666266720000.
The previous prime is 1100000010883. The next prime is 1100000011021. The reversal of 1100000011011 is 1101100000011.
It is a cyclic number.
It is not a de Polignac number, because 1100000011011 - 27 = 1100000010883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1100000011021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9942990 + ... + 10053011.
It is an arithmetic number, because the mean of its divisors is an integer number (100059994008).
Almost surely, 21100000011011 is an apocalyptic number.
1100000011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100000011011 is a deficient number, since it is larger than the sum of its proper divisors (500959893117).
1100000011011 is a wasteful number, since it uses less digits than its factorization.
1100000011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19997682.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1100000011011 its reverse (1101100000011), we get a palindrome (2201100011022).
It can be divided in two parts, 11000000 and 11011, that added together give a palindrome (11011011).
The spelling of 1100000011011 in words is "one trillion, one hundred billion, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •