Base | Representation |
---|---|
bin | 1000011010010100001… |
… | …1011100001101010101 |
3 | 111210222200000012102102 |
4 | 2012211003130031111 |
5 | 4331420241012011 |
6 | 150214522051445 |
7 | 13303630525655 |
oct | 2064503341525 |
9 | 453880005372 |
10 | 144503063381 |
11 | 56313237326 |
12 | 24009949b85 |
13 | 1081b79bc41 |
14 | 6dcb6d4365 |
15 | 3b5b21773b |
hex | 21a50dc355 |
144503063381 has 2 divisors, whose sum is σ = 144503063382. Its totient is φ = 144503063380.
The previous prime is 144503063359. The next prime is 144503063407. The reversal of 144503063381 is 183360305441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 141707826481 + 2795236900 = 376441^2 + 52870^2 .
It is an emirp because it is prime and its reverse (183360305441) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144503063381 is a prime.
It is a super-2 number, since 2×1445030633812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144503063311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72251531690 + 72251531691.
It is an arithmetic number, because the mean of its divisors is an integer number (72251531691).
Almost surely, 2144503063381 is an apocalyptic number.
It is an amenable number.
144503063381 is a deficient number, since it is larger than the sum of its proper divisors (1).
144503063381 is an equidigital number, since it uses as much as digits as its factorization.
144503063381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 144503063381 in words is "one hundred forty-four billion, five hundred three million, sixty-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •