Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …01110100010110010011 |
3 | 10112201000101110100100221 |
4 | 32210112031310112103 |
5 | 112400223111213021 |
6 | 2043522105253511 |
7 | 132220123312423 |
oct | 16442615642623 |
9 | 3481011410327 |
10 | 1001100101011 |
11 | 3566229aa08a |
12 | 14202a494297 |
13 | 7353218349a |
14 | 3664c5b0483 |
15 | 1b09311c241 |
hex | e916374593 |
1001100101011 has 2 divisors, whose sum is σ = 1001100101012. Its totient is φ = 1001100101010.
The previous prime is 1001100100991. The next prime is 1001100101123. The reversal of 1001100101011 is 1101010011001.
It is a happy number.
1001100101011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (1101010011001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1001100101011 - 213 = 1001100092819 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1001100100985 and 1001100101003.
It is not a weakly prime, because it can be changed into another prime (1001100102011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500550050505 + 500550050506.
It is an arithmetic number, because the mean of its divisors is an integer number (500550050506).
Almost surely, 21001100101011 is an apocalyptic number.
1001100101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001100101011 is an equidigital number, since it uses as much as digits as its factorization.
1001100101011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1001100101011 its reverse (1101010011001), we get a palindrome (2102110112012).
The spelling of 1001100101011 in words is "one trillion, one billion, one hundred million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •