Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …000000100011001100110011 |
3 | 111010110102200001202212222222 |
4 | 112300302303000203030303 |
5 | 101110200441324013021 |
6 | 552525540121151255 |
7 | 30041500425204263 |
oct | 2660626300431463 |
9 | 433412601685888 |
10 | 100110101001011 |
11 | 299975011718a2 |
12 | b28a01232b52b |
13 | 43b245a54715a |
14 | 1aa14d75a77a3 |
15 | b891606b86ab |
hex | 5b0cb3023333 |
100110101001011 has 2 divisors, whose sum is σ = 100110101001012. Its totient is φ = 100110101001010.
The previous prime is 100110101000891. The next prime is 100110101001103. The reversal of 100110101001011 is 110100101011001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100110101001011 - 230 = 100109027259187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100110101001011.
It is not a weakly prime, because it can be changed into another prime (100110101001511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055050500505 + 50055050500506.
It is an arithmetic number, because the mean of its divisors is an integer number (50055050500506).
Almost surely, 2100110101001011 is an apocalyptic number.
100110101001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
100110101001011 is an equidigital number, since it uses as much as digits as its factorization.
100110101001011 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 8.
Adding to 100110101001011 its reverse (110100101011001), we get a palindrome (210210202012012).
The spelling of 100110101001011 in words is "one hundred trillion, one hundred ten billion, one hundred one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •