Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …100000010010001101111011 |
3 | 111101111202120000120120101121 |
4 | 113031300332200102031323 |
5 | 101340310332332224011 |
6 | 1001052320152330111 |
7 | 30335361144602242 |
oct | 2715607640221573 |
9 | 441452500516347 |
10 | 102101011211131 |
11 | 2a594883073a39 |
12 | b54ba3a0a3937 |
13 | 44c8112850b1a |
14 | 1b2da02b4b959 |
15 | bc0d3567ee71 |
hex | 5cdc3e81237b |
102101011211131 has 2 divisors, whose sum is σ = 102101011211132. Its totient is φ = 102101011211130.
The previous prime is 102101011211081. The next prime is 102101011211153. The reversal of 102101011211131 is 131112110101201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102101011211131 - 241 = 99901987955579 is a prime.
It is a super-2 number, since 2×1021010112111312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102101011215131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050505605565 + 51050505605566.
It is an arithmetic number, because the mean of its divisors is an integer number (51050505605566).
Almost surely, 2102101011211131 is an apocalyptic number.
102101011211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101011211131 is an equidigital number, since it uses as much as digits as its factorization.
102101011211131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 102101011211131 its reverse (131112110101201), we get a palindrome (233213121312332).
The spelling of 102101011211131 in words is "one hundred two trillion, one hundred one billion, eleven million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •