Base | Representation |
---|---|
bin | 100000110000000111100001… |
… | …100011100110101011110001 |
3 | 200220000111000011101221202120 |
4 | 200300013201203212223301 |
5 | 122340004310204204131 |
6 | 1230204540324504453 |
7 | 42224562065441655 |
oct | 4060074143465361 |
9 | 626014004357676 |
10 | 144044102413041 |
11 | 41995840654556 |
12 | 141a486654b129 |
13 | 624b3ba48a00c |
14 | 277dab39aaa65 |
15 | 119bdb71d3496 |
hex | 8301e18e6af1 |
144044102413041 has 8 divisors (see below), whose sum is σ = 192192828905760. Its totient is φ = 95962388764512.
The previous prime is 144044102413031. The next prime is 144044102413093. The reversal of 144044102413041 is 140314201440441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144044102413041 - 225 = 144044068858609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144044102412993 and 144044102413011.
It is not an unprimeable number, because it can be changed into a prime (144044102413031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16753206031 + ... + 16753214628.
It is an arithmetic number, because the mean of its divisors is an integer number (24024103613220).
Almost surely, 2144044102413041 is an apocalyptic number.
It is an amenable number.
144044102413041 is a deficient number, since it is larger than the sum of its proper divisors (48148726492719).
144044102413041 is a wasteful number, since it uses less digits than its factorization.
144044102413041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33506422095.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 144044102413041 its reverse (140314201440441), we get a palindrome (284358303853482).
The spelling of 144044102413041 in words is "one hundred forty-four trillion, forty-four billion, one hundred two million, four hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •