Base | Representation |
---|---|
bin | 100000110110101100110110… |
… | …111001001010100100001001 |
3 | 200221121201201220222211201122 |
4 | 200312230312321022210021 |
5 | 122414412320424210343 |
6 | 1231152440041125025 |
7 | 42302346054050102 |
oct | 4066546671124411 |
9 | 627551656884648 |
10 | 144496505694473 |
11 | 4204a6954a28a9 |
12 | 14258483489775 |
13 | 6281c6773249a |
14 | 279794d7353a9 |
15 | 11a8a44445068 |
hex | 836b36e4a909 |
144496505694473 has 2 divisors, whose sum is σ = 144496505694474. Its totient is φ = 144496505694472.
The previous prime is 144496505694439. The next prime is 144496505694487. The reversal of 144496505694473 is 374496505694441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88856960401609 + 55639545292864 = 9426397^2 + 7459192^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144496505694473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144496505694397 and 144496505694406.
It is not a weakly prime, because it can be changed into another prime (144496505694773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72248252847236 + 72248252847237.
It is an arithmetic number, because the mean of its divisors is an integer number (72248252847237).
Almost surely, 2144496505694473 is an apocalyptic number.
It is an amenable number.
144496505694473 is a deficient number, since it is larger than the sum of its proper divisors (1).
144496505694473 is an equidigital number, since it uses as much as digits as its factorization.
144496505694473 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1567641600, while the sum is 71.
The spelling of 144496505694473 in words is "one hundred forty-four trillion, four hundred ninety-six billion, five hundred five million, six hundred ninety-four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •