Base | Representation |
---|---|
bin | 100000011001001001011000… |
… | …001011001111011010011111 |
3 | 200200102120110202021220002202 |
4 | 200121021120023033122133 |
5 | 122133123413401100142 |
6 | 1222555433451242115 |
7 | 42002540001132605 |
oct | 4031113013173237 |
9 | 620376422256082 |
10 | 142465544550047 |
11 | 41437330913a54 |
12 | 13b8a93a74933b |
13 | 616559b951814 |
14 | 2727524d25875 |
15 | 1170cc8285032 |
hex | 8192582cf69f |
142465544550047 has 2 divisors, whose sum is σ = 142465544550048. Its totient is φ = 142465544550046.
The previous prime is 142465544550041. The next prime is 142465544550071. The reversal of 142465544550047 is 740055445564241.
It is a weak prime.
It is an emirp because it is prime and its reverse (740055445564241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142465544550047 - 218 = 142465544287903 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142465544549974 and 142465544550001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142465544550041) 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, 71232772275023 + 71232772275024.
It is an arithmetic number, because the mean of its divisors is an integer number (71232772275024).
Almost surely, 2142465544550047 is an apocalyptic number.
142465544550047 is a deficient number, since it is larger than the sum of its proper divisors (1).
142465544550047 is an equidigital number, since it uses as much as digits as its factorization.
142465544550047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760000, while the sum is 56.
The spelling of 142465544550047 in words is "one hundred forty-two trillion, four hundred sixty-five billion, five hundred forty-four million, five hundred fifty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •