Base | Representation |
---|---|
bin | 10110110000101010010100… |
… | …100111001110001100100111 |
3 | 111010102120011212201112201002 |
4 | 112300222110213032030213 |
5 | 101110023322241012221 |
6 | 552521433131023515 |
7 | 30041026060334555 |
oct | 2660522447161447 |
9 | 433376155645632 |
10 | 100101001110311 |
11 | 29993661554273 |
12 | b2882b289ab9b |
13 | 43b163a191046 |
14 | 1aa0cb2bccbd5 |
15 | b88ccb85980b |
hex | 5b0a949ce327 |
100101001110311 has 2 divisors, whose sum is σ = 100101001110312. Its totient is φ = 100101001110310.
The previous prime is 100101001110277. The next prime is 100101001110323. The reversal of 100101001110311 is 113011100101001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100101001110311 - 26 = 100101001110247 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100101001110292 and 100101001110301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100101001110511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050500555155 + 50050500555156.
It is an arithmetic number, because the mean of its divisors is an integer number (50050500555156).
Almost surely, 2100101001110311 is an apocalyptic number.
100101001110311 is a deficient number, since it is larger than the sum of its proper divisors (1).
100101001110311 is an equidigital number, since it uses as much as digits as its factorization.
100101001110311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 100101001110311 its reverse (113011100101001), we get a palindrome (213112101211312).
The spelling of 100101001110311 in words is "one hundred trillion, one hundred one billion, one million, one hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •