Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …010010110011010010011 |
3 | 10221010002211000112102021 |
4 | 100021301022112122103 |
5 | 121141240011213021 |
6 | 2205532122232311 |
7 | 143123560116664 |
oct | 20116112263223 |
9 | 3833084015367 |
10 | 1110000101011 |
11 | 39882613498a |
12 | 15b160955697 |
13 | 808987cc6c9 |
14 | 3ba1d65536b |
15 | 1dd1887dc41 |
hex | 10271296693 |
1110000101011 has 8 divisors (see below), whose sum is σ = 1158843942144. Its totient is φ = 1061204840520.
The previous prime is 1110000100997. The next prime is 1110000101017. The reversal of 1110000101011 is 1101010000111.
It is a happy number.
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 1110000101011 - 27 = 1110000100883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110000100985 and 1110000101003.
It is not an unprimeable number, because it can be changed into a prime (1110000101017) 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 7 ways as a sum of consecutive naturals, for example, 12098455 + ... + 12189856.
It is an arithmetic number, because the mean of its divisors is an integer number (144855492768).
Almost surely, 21110000101011 is an apocalyptic number.
1110000101011 is a deficient number, since it is larger than the sum of its proper divisors (48843841133).
1110000101011 is a wasteful number, since it uses less digits than its factorization.
1110000101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24290321.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1110000101011 its reverse (1101010000111), we get a palindrome (2211010101122).
The spelling of 1110000101011 in words is "one trillion, one hundred ten billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •