Base | Representation |
---|---|
bin | 11101110010010100010011… |
… | …011101101011100101101001 |
3 | 122011211120210120112000112021 |
4 | 131302110103131223211221 |
5 | 114132310300223334423 |
6 | 1142341030252344441 |
7 | 36410342655522232 |
oct | 3562242335534551 |
9 | 564746716460467 |
10 | 131001124043113 |
11 | 388172a036a375 |
12 | 12838a8b475121 |
13 | 581347869c19c |
14 | 244c6b9a02089 |
15 | 102298e84495d |
hex | 77251376b969 |
131001124043113 has 2 divisors, whose sum is σ = 131001124043114. Its totient is φ = 131001124043112.
The previous prime is 131001124043099. The next prime is 131001124043129. The reversal of 131001124043113 is 311340421100131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130866575934249 + 134548108864 = 11439693^2 + 366808^2 .
It is a cyclic number.
It is not a de Polignac number, because 131001124043113 - 29 = 131001124042601 is a prime.
It is a super-2 number, since 2×1310011240431132 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (131001124043143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65500562021556 + 65500562021557.
It is an arithmetic number, because the mean of its divisors is an integer number (65500562021557).
Almost surely, 2131001124043113 is an apocalyptic number.
It is an amenable number.
131001124043113 is a deficient number, since it is larger than the sum of its proper divisors (1).
131001124043113 is an equidigital number, since it uses as much as digits as its factorization.
131001124043113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 131001124043113 its reverse (311340421100131), we get a palindrome (442341545143244).
The spelling of 131001124043113 in words is "one hundred thirty-one trillion, one billion, one hundred twenty-four million, forty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •