Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …00101111010011000011 |
3 | 10112121110110022100221222 |
4 | 32203123100233103003 |
5 | 112341211404323021 |
6 | 2043240013505255 |
7 | 132153453221210 |
oct | 16433320572303 |
9 | 3477413270858 |
10 | 1000111011011 |
11 | 356165658132 |
12 | 1419b31a222b |
13 | 73405296128 |
14 | 365970a2b07 |
15 | 1b0363936ab |
hex | e8db42f4c3 |
1000111011011 has 8 divisors (see below), whose sum is σ = 1145635951104. Its totient is φ = 855249055560.
The previous prime is 1000111010971. The next prime is 1000111011043. The reversal of 1000111011011 is 1101101110001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000111011011 - 26 = 1000111010947 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 1000111011011.
It is not an unprimeable number, because it can be changed into a prime (1000111017011) 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, 165742925 + ... + 165748958.
It is an arithmetic number, because the mean of its divisors is an integer number (143204493888).
Almost surely, 21000111011011 is an apocalyptic number.
1000111011011 is a deficient number, since it is larger than the sum of its proper divisors (145524940093).
1000111011011 is an equidigital number, since it uses as much as digits as its factorization.
1000111011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331492321.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1000111011011 its reverse (1101101110001), we get a palindrome (2101212121012).
It can be divided in two parts, 10001 and 11011011, that multiplied together give a palindrome (110121121011).
The spelling of 1000111011011 in words is "one trillion, one hundred eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •