Base | Representation |
---|---|
bin | 100000101111111010110111… |
… | …000110000001110101111000 |
3 | 200212222011220112200122102102 |
4 | 200233322313012001311320 |
5 | 122334243433302140000 |
6 | 1230154411155322532 |
7 | 42223601120350430 |
oct | 4057726706016570 |
9 | 625864815618372 |
10 | 144030505115000 |
11 | 4198aaa32a7259 |
12 | 141a20b08b0448 |
13 | 624a03142752a |
14 | 277d183b9d2c0 |
15 | 119b86d5e93d5 |
hex | 82feb7181d78 |
144030505115000 has 320 divisors, whose sum is σ = 387043450200000. Its totient is φ = 49206657024000.
The previous prime is 144030505114997. The next prime is 144030505115023. The reversal of 144030505115000 is 511505030441.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 12713429336 + ... + 12713440664.
It is an arithmetic number, because the mean of its divisors is an integer number (1209510781875).
Almost surely, 2144030505115000 is an apocalyptic number.
144030505115000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144030505115000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193521725100000).
144030505115000 is an abundant number, since it is smaller than the sum of its proper divisors (243012945085000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144030505115000 is a wasteful number, since it uses less digits than its factorization.
144030505115000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12620 (or 12601 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 29.
The spelling of 144030505115000 in words is "one hundred forty-four trillion, thirty billion, five hundred five million, one hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •