Base | Representation |
---|---|
bin | 10110111111001110101011… |
… | …010110111111000100111011 |
3 | 111020222021012212220222210002 |
4 | 112333032223112333010323 |
5 | 101222424110142010021 |
6 | 555005400155143215 |
7 | 30203246352412103 |
oct | 2677165326770473 |
9 | 436867185828702 |
10 | 101102110110011 |
11 | 2a23a18948103a |
12 | b40a324144b0b |
13 | 4454b7113ba0a |
14 | 1ad7522638203 |
15 | ba4d7063350b |
hex | 5bf3ab5bf13b |
101102110110011 has 2 divisors, whose sum is σ = 101102110110012. Its totient is φ = 101102110110010.
The previous prime is 101102110109963. The next prime is 101102110110017. The reversal of 101102110110011 is 110011011201101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101102110110011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101102110109974 and 101102110110001.
It is not a weakly prime, because it can be changed into another prime (101102110110017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551055055005 + 50551055055006.
It is an arithmetic number, because the mean of its divisors is an integer number (50551055055006).
Almost surely, 2101102110110011 is an apocalyptic number.
101102110110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102110110011 is an equidigital number, since it uses as much as digits as its factorization.
101102110110011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 101102110110011 its reverse (110011011201101), we get a palindrome (211113121311112).
The spelling of 101102110110011 in words is "one hundred one trillion, one hundred two billion, one hundred ten million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •