Base | Representation |
---|---|
bin | 100000110000000011110100… |
… | …111010111001101100101011 |
3 | 200220000002202110222100000011 |
4 | 200300003310322321230223 |
5 | 122334423142333220133 |
6 | 1230203042343552351 |
7 | 42224361520265551 |
oct | 4060036472715453 |
9 | 626002673870004 |
10 | 144040132320043 |
11 | 41994093637963 |
12 | 141a3b38a5b6b7 |
13 | 624ac06b0a16b |
14 | 277d8185ddbd1 |
15 | 119bc338b96cd |
hex | 8300f4eb9b2b |
144040132320043 has 2 divisors, whose sum is σ = 144040132320044. Its totient is φ = 144040132320042.
The previous prime is 144040132320023. The next prime is 144040132320113. The reversal of 144040132320043 is 340023231040441.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 144040132320043 - 213 = 144040132311851 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144040132319987 and 144040132320014.
It is not a weakly prime, because it can be changed into another prime (144040132320023) 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, 72020066160021 + 72020066160022.
It is an arithmetic number, because the mean of its divisors is an integer number (72020066160022).
Almost surely, 2144040132320043 is an apocalyptic number.
144040132320043 is a deficient number, since it is larger than the sum of its proper divisors (1).
144040132320043 is an equidigital number, since it uses as much as digits as its factorization.
144040132320043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 144040132320043 its reverse (340023231040441), we get a palindrome (484063363360484).
The spelling of 144040132320043 in words is "one hundred forty-four trillion, forty billion, one hundred thirty-two million, three hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •