Base | Representation |
---|---|
bin | 100000101111111110011011… |
… | …110010100110000100111000 |
3 | 200212222112210221110202021101 |
4 | 200233332123302212010320 |
5 | 122334324313023044000 |
6 | 1230200244021221144 |
7 | 42224065160354011 |
oct | 4057763362460470 |
9 | 625875727422241 |
10 | 144034342003000 |
11 | 41991692102a79 |
12 | 141a29a18617b4 |
13 | 624a4c3308b67 |
14 | 277d4295b4008 |
15 | 119b9e539ee6a |
hex | 82ff9bca6138 |
144034342003000 has 64 divisors (see below), whose sum is σ = 337067175107520. Its totient is φ = 57609153072000.
The previous prime is 144034342002931. The next prime is 144034342003031. The reversal of 144034342003000 is 300243430441.
It is a self number, because there is not a number n which added to its sum of digits gives 144034342003000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6859630 + ... + 18306370.
It is an arithmetic number, because the mean of its divisors is an integer number (5266674611055).
Almost surely, 2144034342003000 is an apocalyptic number.
144034342003000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144034342003000 is an abundant number, since it is smaller than the sum of its proper divisors (193032833104520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144034342003000 is a wasteful number, since it uses less digits than its factorization.
144034342003000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11459345 (or 11459331 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 144034342003000 its reverse (300243430441), we get a palindrome (144334585433441).
The spelling of 144034342003000 in words is "one hundred forty-four trillion, thirty-four billion, three hundred forty-two million, three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •