Base | Representation |
---|---|
bin | 1000100000110101100… |
… | …0000110110101101101 |
3 | 111222111122102000020221 |
4 | 2020031120012311231 |
5 | 4344011321430331 |
6 | 151104324011341 |
7 | 13365202430464 |
oct | 2101530066555 |
9 | 458448360227 |
10 | 146253311341 |
11 | 570311aa545 |
12 | 24417b30b51 |
13 | 10a3a28c717 |
14 | 7115d399db |
15 | 3c0ebe4711 |
hex | 220d606d6d |
146253311341 has 2 divisors, whose sum is σ = 146253311342. Its totient is φ = 146253311340.
The previous prime is 146253311311. The next prime is 146253311461. The reversal of 146253311341 is 143113352641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132037756900 + 14215554441 = 363370^2 + 119229^2 .
It is a cyclic number.
It is not a de Polignac number, because 146253311341 - 233 = 137663376749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146253311297 and 146253311306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146253311311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73126655670 + 73126655671.
It is an arithmetic number, because the mean of its divisors is an integer number (73126655671).
Almost surely, 2146253311341 is an apocalyptic number.
It is an amenable number.
146253311341 is a deficient number, since it is larger than the sum of its proper divisors (1).
146253311341 is an equidigital number, since it uses as much as digits as its factorization.
146253311341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 34.
Adding to 146253311341 its reverse (143113352641), we get a palindrome (289366663982).
The spelling of 146253311341 in words is "one hundred forty-six billion, two hundred fifty-three million, three hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •