Base | Representation |
---|---|
bin | 100001010100001100010010… |
… | …111001101000100111000001 |
3 | 201012210110210121101201112211 |
4 | 201110030102321220213001 |
5 | 123201113330324321343 |
6 | 1235343443420222121 |
7 | 42601642443611623 |
oct | 4124142271504701 |
9 | 635713717351484 |
10 | 146523126401473 |
11 | 42761122004888 |
12 | 145251b669a941 |
13 | 639b0c1205c93 |
14 | 2827a858d2c13 |
15 | 11e160953479d |
hex | 854312e689c1 |
146523126401473 has 2 divisors, whose sum is σ = 146523126401474. Its totient is φ = 146523126401472.
The previous prime is 146523126401381. The next prime is 146523126401513. The reversal of 146523126401473 is 374104621325641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108933327774769 + 37589798626704 = 10437113^2 + 6131052^2 .
It is a cyclic number.
It is not a de Polignac number, because 146523126401473 - 29 = 146523126400961 is a prime.
It is not a weakly prime, because it can be changed into another prime (146523126401573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73261563200736 + 73261563200737.
It is an arithmetic number, because the mean of its divisors is an integer number (73261563200737).
Almost surely, 2146523126401473 is an apocalyptic number.
It is an amenable number.
146523126401473 is a deficient number, since it is larger than the sum of its proper divisors (1).
146523126401473 is an equidigital number, since it uses as much as digits as its factorization.
146523126401473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 49.
The spelling of 146523126401473 in words is "one hundred forty-six trillion, five hundred twenty-three billion, one hundred twenty-six million, four hundred one thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •