Base | Representation |
---|---|
bin | 1000011010100100111… |
… | …0010111101001010000 |
3 | 111211011112200020100222 |
4 | 2012221032113221100 |
5 | 4332041144142021 |
6 | 150225501532212 |
7 | 13305440353043 |
oct | 2065116275120 |
9 | 454145606328 |
10 | 144573037136 |
11 | 5634978a680 |
12 | 24029274068 |
13 | 1083012b828 |
14 | 6dd6b0ac5a |
15 | 3b6243a6ab |
hex | 21a9397a50 |
144573037136 has 80 divisors (see below), whose sum is σ = 307481177088. Its totient is φ = 65305766400.
The previous prime is 144573037121. The next prime is 144573037157. The reversal of 144573037136 is 631730375441.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53683406 + ... + 53686098.
Almost surely, 2144573037136 is an apocalyptic number.
144573037136 is a gapful number since it is divisible by the number (16) 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 144573037136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153740588544).
144573037136 is an abundant number, since it is smaller than the sum of its proper divisors (162908139952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144573037136 is a wasteful number, since it uses less digits than its factorization.
144573037136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4500 (or 4494 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 44.
The spelling of 144573037136 in words is "one hundred forty-four billion, five hundred seventy-three million, thirty-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •