Base | Representation |
---|---|
bin | 100001010001100110100000… |
… | …010011100000100101000011 |
3 | 201012011110022100101221022111 |
4 | 201101212200103200211003 |
5 | 123140204241144122342 |
6 | 1235130003202120151 |
7 | 42553041153446431 |
oct | 4121464023404503 |
9 | 635143270357274 |
10 | 146345110145347 |
11 | 426a2681516853 |
12 | 144b67b5350057 |
13 | 6387391566799 |
14 | 281d1d935dd51 |
15 | 11dbb8b07c217 |
hex | 8519a04e0943 |
146345110145347 has 2 divisors, whose sum is σ = 146345110145348. Its totient is φ = 146345110145346.
The previous prime is 146345110145329. The next prime is 146345110145387. The reversal of 146345110145347 is 743541011543641.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 146345110145347 - 211 = 146345110143299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 146345110145347.
It is not a weakly prime, because it can be changed into another prime (146345110145387) 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, 73172555072673 + 73172555072674.
It is an arithmetic number, because the mean of its divisors is an integer number (73172555072674).
Almost surely, 2146345110145347 is an apocalyptic number.
146345110145347 is a deficient number, since it is larger than the sum of its proper divisors (1).
146345110145347 is an equidigital number, since it uses as much as digits as its factorization.
146345110145347 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2419200, while the sum is 49.
Adding to 146345110145347 its reverse (743541011543641), we get a palindrome (889886121688988).
The spelling of 146345110145347 in words is "one hundred forty-six trillion, three hundred forty-five billion, one hundred ten million, one hundred forty-five thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •