Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …000101001000100000100011 |
3 | 111010001220111122100012222121 |
4 | 112233030101011020200203 |
5 | 101101400010042023021 |
6 | 552403212003245111 |
7 | 30030522321113353 |
oct | 2657142105104043 |
9 | 433056448305877 |
10 | 100000010111011 |
11 | 2995484779278a |
12 | b270809079797 |
13 | 43a4c642761aa |
14 | 1a9a0522c4b63 |
15 | b8636a61a741 |
hex | 5af311148823 |
100000010111011 has 2 divisors, whose sum is σ = 100000010111012. Its totient is φ = 100000010111010.
The previous prime is 100000010111009. The next prime is 100000010111017. The reversal of 100000010111011 is 110111010000001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100000010111011 - 21 = 100000010111009 is a prime.
Together with 100000010111009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 100000010110985 and 100000010111003.
It is not a weakly prime, because it can be changed into another prime (100000010111017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000005055505 + 50000005055506.
It is an arithmetic number, because the mean of its divisors is an integer number (50000005055506).
Almost surely, 2100000010111011 is an apocalyptic number.
100000010111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
100000010111011 is an equidigital number, since it uses as much as digits as its factorization.
100000010111011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100000010111011 its reverse (110111010000001), we get a palindrome (210111020111012).
The spelling of 100000010111011 in words is "one hundred trillion, ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •