Base | Representation |
---|---|
bin | 100000110000000111011101… |
… | …001111010111101110000001 |
3 | 200220000110211010010222202010 |
4 | 200300013131033113232001 |
5 | 122340004133140000001 |
6 | 1230204525220443133 |
7 | 42224560226105145 |
oct | 4060073517275601 |
9 | 626013733128663 |
10 | 144044030000001 |
11 | 4199580379556a |
12 | 141a48462494a9 |
13 | 624b3a8485071 |
14 | 277daa811b225 |
15 | 119bdb0b7c8d6 |
hex | 8301dd3d7b81 |
144044030000001 has 8 divisors (see below), whose sum is σ = 192073663396384. Its totient is φ = 96021874968480.
The previous prime is 144044029999997. The next prime is 144044030000069. The reversal of 144044030000001 is 100000030440441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144044030000001 - 22 = 144044029999997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144044030000201) 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 7 ways as a sum of consecutive naturals, for example, 1869546271 + ... + 1869623316.
It is an arithmetic number, because the mean of its divisors is an integer number (24009207924548).
Almost surely, 2144044030000001 is an apocalyptic number.
It is an amenable number.
144044030000001 is a deficient number, since it is larger than the sum of its proper divisors (48029633396383).
144044030000001 is a wasteful number, since it uses less digits than its factorization.
144044030000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3739182431.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 144044030000001 its reverse (100000030440441), we get a palindrome (244044060440442).
The spelling of 144044030000001 in words is "one hundred forty-four trillion, forty-four billion, thirty million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •