Base | Representation |
---|---|
bin | 100000110001000101000101… |
… | …011101010110010001110110 |
3 | 200220020210121211022220001220 |
4 | 200301011011131112101312 |
5 | 122342100143432112042 |
6 | 1230255151401531210 |
7 | 42232422113261133 |
oct | 4061050535262166 |
9 | 626223554286056 |
10 | 144110203004022 |
11 | 41a10880717942 |
12 | 141b56334a3b06 |
13 | 62546c2aa2748 |
14 | 2782d8477558a |
15 | 119d9852dd8ec |
hex | 831145756476 |
144110203004022 has 8 divisors (see below), whose sum is σ = 288220406008056. Its totient is φ = 48036734334672.
The previous prime is 144110203003919. The next prime is 144110203004077. The reversal of 144110203004022 is 220400302011441.
It is a sphenic number, since it is the product of 3 distinct primes.
144110203004022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 144110203003983 and 144110203004001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12009183583663 + ... + 12009183583674.
It is an arithmetic number, because the mean of its divisors is an integer number (36027550751007).
Almost surely, 2144110203004022 is an apocalyptic number.
144110203004022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144110203004022 is a wasteful number, since it uses less digits than its factorization.
144110203004022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24018367167342.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 144110203004022 its reverse (220400302011441), we get a palindrome (364510505015463).
The spelling of 144110203004022 in words is "one hundred forty-four trillion, one hundred ten billion, two hundred three million, four thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •