Base | Representation |
---|---|
bin | 100000110010000110111111… |
… | …010100011110000101001101 |
3 | 200220111120021111020000102110 |
4 | 200302012333110132011031 |
5 | 122344230110021130043 |
6 | 1230351453303214233 |
7 | 42240505525141632 |
oct | 4062067724360515 |
9 | 626446244200373 |
10 | 144180966973773 |
11 | 41a38894080774 |
12 | 142072a2147379 |
13 | 625b28c5962b2 |
14 | 2786578a18189 |
15 | 11a0727a0ab33 |
hex | 8321bf51e14d |
144180966973773 has 16 divisors (see below), whose sum is σ = 195925812192000. Its totient is φ = 94295845396800.
The previous prime is 144180966973751. The next prime is 144180966973807. The reversal of 144180966973773 is 377379669081441.
It is not a de Polignac number, because 144180966973773 - 29 = 144180966973261 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144180966973695 and 144180966973704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144180966873773) 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 in 15 ways as a sum of consecutive naturals, for example, 2182741173 + ... + 2182807226.
It is an arithmetic number, because the mean of its divisors is an integer number (12245363262000).
Almost surely, 2144180966973773 is an apocalyptic number.
It is an amenable number.
144180966973773 is a deficient number, since it is larger than the sum of its proper divisors (51744845218227).
144180966973773 is a wasteful number, since it uses less digits than its factorization.
144180966973773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4365548612.
The product of its (nonzero) digits is 1152216576, while the sum is 75.
The spelling of 144180966973773 in words is "one hundred forty-four trillion, one hundred eighty billion, nine hundred sixty-six million, nine hundred seventy-three thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •