Base | Representation |
---|---|
bin | 100000110100010011000001… |
… | …101001011100010010101101 |
3 | 200221000221101112120010210002 |
4 | 200310103001221130102231 |
5 | 122404211030422200021 |
6 | 1230544521514154045 |
7 | 42254410621566335 |
oct | 4064230151342255 |
9 | 627027345503702 |
10 | 144331329881261 |
11 | 41a9663400a666 |
12 | 14230466422925 |
13 | 626c50309a9c3 |
14 | 278d9606760c5 |
15 | 11a45c83c350b |
hex | 8344c1a5c4ad |
144331329881261 has 2 divisors, whose sum is σ = 144331329881262. Its totient is φ = 144331329881260.
The previous prime is 144331329881191. The next prime is 144331329881357. The reversal of 144331329881261 is 162188923133441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89029886869225 + 55301443012036 = 9435565^2 + 7436494^2 .
It is a cyclic number.
It is not a de Polignac number, because 144331329881261 - 230 = 144330256139437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144331329881197 and 144331329881206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144331319881261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72165664940630 + 72165664940631.
It is an arithmetic number, because the mean of its divisors is an integer number (72165664940631).
Almost surely, 2144331329881261 is an apocalyptic number.
It is an amenable number.
144331329881261 is a deficient number, since it is larger than the sum of its proper divisors (1).
144331329881261 is an equidigital number, since it uses as much as digits as its factorization.
144331329881261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5971968, while the sum is 56.
The spelling of 144331329881261 in words is "one hundred forty-four trillion, three hundred thirty-one billion, three hundred twenty-nine million, eight hundred eighty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •