Base | Representation |
---|---|
bin | 100000111111111011110010… |
… | …011010110000101001101011 |
3 | 201000212101111202121112002202 |
4 | 200333323302122300221223 |
5 | 123010311303040030011 |
6 | 1232400133322050415 |
7 | 42366240525664415 |
oct | 4077736232605153 |
9 | 630771452545082 |
10 | 145131012033131 |
11 | 4227479780a353 |
12 | 1433b442349a0b |
13 | 62c9a4623a757 |
14 | 27ba5426dd9b5 |
15 | 11ba2cd82d23b |
hex | 83fef26b0a6b |
145131012033131 has 2 divisors, whose sum is σ = 145131012033132. Its totient is φ = 145131012033130.
The previous prime is 145131012033107. The next prime is 145131012033173. The reversal of 145131012033131 is 131330210131541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 145131012033131 - 26 = 145131012033067 is a prime.
It is a super-2 number, since 2×1451310120331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145131012033094 and 145131012033103.
It is not a weakly prime, because it can be changed into another prime (145131012033101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72565506016565 + 72565506016566.
It is an arithmetic number, because the mean of its divisors is an integer number (72565506016566).
Almost surely, 2145131012033131 is an apocalyptic number.
145131012033131 is a deficient number, since it is larger than the sum of its proper divisors (1).
145131012033131 is an equidigital number, since it uses as much as digits as its factorization.
145131012033131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 145131012033131 its reverse (131330210131541), we get a palindrome (276461222164672).
The spelling of 145131012033131 in words is "one hundred forty-five trillion, one hundred thirty-one billion, twelve million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •