Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1001010001111100001011 |
3 | 1102222112201211121110011101 |
4 | 2200031313021101330023 |
5 | 2420341440011214011 |
6 | 35225531344242231 |
7 | 2214306031506163 |
oct | 240156711217413 |
9 | 42875654543141 |
10 | 11010000101131 |
11 | 35653510329a9 |
12 | 129998a910377 |
13 | 61b314148565 |
14 | 2a0c5b7235a3 |
15 | 1415de5872c1 |
hex | a0377251f0b |
11010000101131 has 2 divisors, whose sum is σ = 11010000101132. Its totient is φ = 11010000101130.
The previous prime is 11010000101081. The next prime is 11010000101159. The reversal of 11010000101131 is 13110100001011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11010000101131 - 215 = 11010000068363 is a prime.
It is a super-3 number, since 3×110100001011313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (11010000101161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505000050565 + 5505000050566.
It is an arithmetic number, because the mean of its divisors is an integer number (5505000050566).
Almost surely, 211010000101131 is an apocalyptic number.
11010000101131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010000101131 is an equidigital number, since it uses as much as digits as its factorization.
11010000101131 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 10.
Adding to 11010000101131 its reverse (13110100001011), we get a palindrome (24120100102142).
The spelling of 11010000101131 in words is "eleven trillion, ten billion, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •