Base | Representation |
---|---|
bin | 11101110010011110101001… |
… | …000101011011111000101011 |
3 | 122011212122110011102122010102 |
4 | 131302132221011123320223 |
5 | 114133001013344014311 |
6 | 1142350103535340015 |
7 | 36411215022401261 |
oct | 3562365105337053 |
9 | 564778404378112 |
10 | 131012224204331 |
11 | 38820a77099828 |
12 | 1283b06898160b |
13 | 5814527295812 |
14 | 244d04dd06431 |
15 | 1022dde0bb43b |
hex | 7727a915be2b |
131012224204331 has 2 divisors, whose sum is σ = 131012224204332. Its totient is φ = 131012224204330.
The previous prime is 131012224204321. The next prime is 131012224204373. The reversal of 131012224204331 is 133402422210131.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 131012224204331 - 210 = 131012224203307 is a prime.
It is a super-2 number, since 2×1310122242043312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131012224204294 and 131012224204303.
It is not a weakly prime, because it can be changed into another prime (131012224204321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65506112102165 + 65506112102166.
It is an arithmetic number, because the mean of its divisors is an integer number (65506112102166).
Almost surely, 2131012224204331 is an apocalyptic number.
131012224204331 is a deficient number, since it is larger than the sum of its proper divisors (1).
131012224204331 is an equidigital number, since it uses as much as digits as its factorization.
131012224204331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 131012224204331 its reverse (133402422210131), we get a palindrome (264414646414462).
The spelling of 131012224204331 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-four million, two hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •