Base | Representation |
---|---|
bin | 100000110000000111100001… |
… | …100011100110100010010001 |
3 | 200220000111000011101220221001 |
4 | 200300013201203212202101 |
5 | 122340004310204144213 |
6 | 1230204540324502001 |
7 | 42224562065440126 |
oct | 4060074143464221 |
9 | 626014004356831 |
10 | 144044102412433 |
11 | 41995840654053 |
12 | 141a486654a901 |
13 | 624b3ba489962 |
14 | 277dab39aa74d |
15 | 119bdb71d31dd |
hex | 8301e18e6891 |
144044102412433 has 48 divisors (see below), whose sum is σ = 155769036508800. Its totient is φ = 133147105064960.
The previous prime is 144044102412401. The next prime is 144044102412481. The reversal of 144044102412433 is 334214201440441.
It is not a de Polignac number, because 144044102412433 - 25 = 144044102412401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144044102412392 and 144044102412401.
It is not an unprimeable number, because it can be changed into a prime (144044102412533) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6457338666 + ... + 6457360972.
It is an arithmetic number, because the mean of its divisors is an integer number (3245188260600).
Almost surely, 2144044102412433 is an apocalyptic number.
It is an amenable number.
144044102412433 is a deficient number, since it is larger than the sum of its proper divisors (11724934096367).
144044102412433 is a wasteful number, since it uses less digits than its factorization.
144044102412433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23610 (or 23593 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 144044102412433 its reverse (334214201440441), we get a palindrome (478258303852874).
The spelling of 144044102412433 in words is "one hundred forty-four trillion, forty-four billion, one hundred two million, four hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •