Base | Representation |
---|---|
bin | 100001010001101110001001… |
… | …101111011110101100110111 |
3 | 201012012020111121120211002202 |
4 | 201101232021233132230313 |
5 | 123140323100303130221 |
6 | 1235133442052455115 |
7 | 42553451512225661 |
oct | 4121561157365467 |
9 | 635166447524082 |
10 | 146353321536311 |
11 | 426a610564737a |
12 | 144b830731a49b |
13 | 638809c8218c6 |
14 | 281d777b33531 |
15 | 11dbebbdd1d0b |
hex | 851b89bdeb37 |
146353321536311 has 2 divisors, whose sum is σ = 146353321536312. Its totient is φ = 146353321536310.
The previous prime is 146353321536251. The next prime is 146353321536313. The reversal of 146353321536311 is 113635123353641.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146353321536311 is a prime.
Together with 146353321536313, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146353321536313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73176660768155 + 73176660768156.
It is an arithmetic number, because the mean of its divisors is an integer number (73176660768156).
Almost surely, 2146353321536311 is an apocalyptic number.
146353321536311 is a deficient number, since it is larger than the sum of its proper divisors (1).
146353321536311 is an equidigital number, since it uses as much as digits as its factorization.
146353321536311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1749600, while the sum is 47.
Adding to 146353321536311 its reverse (113635123353641), we get a palindrome (259988444889952).
The spelling of 146353321536311 in words is "one hundred forty-six trillion, three hundred fifty-three billion, three hundred twenty-one million, five hundred thirty-six thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •