Base | Representation |
---|---|
bin | 100001010001100110100000… |
… | …111001100111110011110001 |
3 | 201012011110100001012112111201 |
4 | 201101212200321213303301 |
5 | 123140204301223331213 |
6 | 1235130004200211201 |
7 | 42553041334411111 |
oct | 4121464071476361 |
9 | 635143301175451 |
10 | 146345120136433 |
11 | 426a2687120249 |
12 | 144b67b8769b01 |
13 | 638739365427a |
14 | 281d1da801041 |
15 | 11dbb8bda26dd |
hex | 8519a0e67cf1 |
146345120136433 has 2 divisors, whose sum is σ = 146345120136434. Its totient is φ = 146345120136432.
The previous prime is 146345120136367. The next prime is 146345120136443. The reversal of 146345120136433 is 334631021543641.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144057197678689 + 2287922457744 = 12002383^2 + 1512588^2 .
It is a cyclic number.
It is not a de Polignac number, because 146345120136433 - 217 = 146345120005361 is a prime.
It is not a weakly prime, because it can be changed into another prime (146345120136443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73172560068216 + 73172560068217.
It is an arithmetic number, because the mean of its divisors is an integer number (73172560068217).
Almost surely, 2146345120136433 is an apocalyptic number.
It is an amenable number.
146345120136433 is a deficient number, since it is larger than the sum of its proper divisors (1).
146345120136433 is an equidigital number, since it uses as much as digits as its factorization.
146345120136433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1866240, while the sum is 46.
The spelling of 146345120136433 in words is "one hundred forty-six trillion, three hundred forty-five billion, one hundred twenty million, one hundred thirty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •