Base | Representation |
---|---|
bin | 100000110110111011111001… |
… | …010010111001010010011001 |
3 | 200221200021102012100022021212 |
4 | 200312323321102321102121 |
5 | 122420143402420334431 |
6 | 1231204110151112505 |
7 | 42303460144315445 |
oct | 4066737122712231 |
9 | 627607365308255 |
10 | 144512652121241 |
11 | 4205652075a258 |
12 | 1425b62a972735 |
13 | 628363b936071 |
14 | 2798641d01825 |
15 | 11a918bc1172b |
hex | 836ef94b9499 |
144512652121241 has 2 divisors, whose sum is σ = 144512652121242. Its totient is φ = 144512652121240.
The previous prime is 144512652121223. The next prime is 144512652121291. The reversal of 144512652121241 is 142121256215441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 135934612810000 + 8578039311241 = 11659100^2 + 2928829^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144512652121241 is a prime.
It is a super-5 number, since 5×1445126521212415 (a number of 72 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (144512652121291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72256326060620 + 72256326060621.
It is an arithmetic number, because the mean of its divisors is an integer number (72256326060621).
Almost surely, 2144512652121241 is an apocalyptic number.
It is an amenable number.
144512652121241 is a deficient number, since it is larger than the sum of its proper divisors (1).
144512652121241 is an equidigital number, since it uses as much as digits as its factorization.
144512652121241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 153600, while the sum is 41.
The spelling of 144512652121241 in words is "one hundred forty-four trillion, five hundred twelve billion, six hundred fifty-two million, one hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •