Base | Representation |
---|---|
bin | 100000101111111010100000… |
… | …111000000000011110011111 |
3 | 200212222010221120020202010121 |
4 | 200233322200320000132133 |
5 | 122334242202334400024 |
6 | 1230154310201415411 |
7 | 42223555643000626 |
oct | 4057724070003637 |
9 | 625863846222117 |
10 | 144030132340639 |
11 | 4198a921937376 |
12 | 141a2007a9a567 |
13 | 6249ca212919c |
14 | 277d14a4846bd |
15 | 119b84aa128e4 |
hex | 82fea0e0079f |
144030132340639 has 2 divisors, whose sum is σ = 144030132340640. Its totient is φ = 144030132340638.
The previous prime is 144030132340597. The next prime is 144030132340667. The reversal of 144030132340639 is 936043231030441.
It is a strong prime.
It is an emirp because it is prime and its reverse (936043231030441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144030132340639 - 215 = 144030132307871 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144030132340595 and 144030132340604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144030132140639) 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, 72015066170319 + 72015066170320.
It is an arithmetic number, because the mean of its divisors is an integer number (72015066170320).
Almost surely, 2144030132340639 is an apocalyptic number.
144030132340639 is a deficient number, since it is larger than the sum of its proper divisors (1).
144030132340639 is an equidigital number, since it uses as much as digits as its factorization.
144030132340639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 43.
The spelling of 144030132340639 in words is "one hundred forty-four trillion, thirty billion, one hundred thirty-two million, three hundred forty thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •