Base | Representation |
---|---|
bin | 1000011010101110011… |
… | …1101110001010000000 |
3 | 111211021100022121201202 |
4 | 2012223213232022000 |
5 | 4332131442044001 |
6 | 150233455320332 |
7 | 13306436143646 |
oct | 2065347561200 |
9 | 454240277652 |
10 | 144613237376 |
11 | 5636a447713 |
12 | 2403a8200a8 |
13 | 1083856555a |
14 | 6ddc1b3196 |
15 | 3b65c2b96b |
hex | 21ab9ee280 |
144613237376 has 32 divisors (see below), whose sum is σ = 292396651680. Its totient is φ = 71227411200.
The previous prime is 144613237369. The next prime is 144613237387. The reversal of 144613237376 is 673732316441.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 144613237376.
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 3 ways as a sum of consecutive naturals, for example, 8422700 + ... + 8439851.
It is an arithmetic number, because the mean of its divisors is an integer number (9137395365).
Almost surely, 2144613237376 is an apocalyptic number.
144613237376 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
144613237376 is an abundant number, since it is smaller than the sum of its proper divisors (147783414304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144613237376 is an equidigital number, since it uses as much as digits as its factorization.
144613237376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16862632 (or 16862620 counting only the distinct ones).
The product of its digits is 1524096, while the sum is 47.
The spelling of 144613237376 in words is "one hundred forty-four billion, six hundred thirteen million, two hundred thirty-seven thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •