Base | Representation |
---|---|
bin | 1000011010011001001… |
… | …1100011011110100000 |
3 | 111211001010112011210000 |
4 | 2012212103203132200 |
5 | 4331441130032142 |
6 | 150220552140000 |
7 | 13304304165141 |
oct | 2064623433640 |
9 | 454033464700 |
10 | 144524064672 |
11 | 56324080969 |
12 | 24014997600 |
13 | 10822c43040 |
14 | 6dd03ddac8 |
15 | 3b5ceb514c |
hex | 21a64e37a0 |
144524064672 has 120 divisors (see below), whose sum is σ = 457736847876. Its totient is φ = 44468932608.
The previous prime is 144524064613. The next prime is 144524064679. The reversal of 144524064672 is 276460425441.
It is a happy number.
144524064672 is a `hidden beast` number, since 1 + 4 + 4 + 524 + 0 + 64 + 67 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 139072309776 + 5451754896 = 372924^2 + 73836^2 .
It is not an unprimeable number, because it can be changed into a prime (144524064679) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 2110833 + ... + 2178224.
Almost surely, 2144524064672 is an apocalyptic number.
144524064672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144524064672 is an abundant number, since it is smaller than the sum of its proper divisors (313212783204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144524064672 is a wasteful number, since it uses less digits than its factorization.
144524064672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4289092 (or 4289075 counting only the distinct ones).
The product of its (nonzero) digits is 1290240, while the sum is 45.
The spelling of 144524064672 in words is "one hundred forty-four billion, five hundred twenty-four million, sixty-four thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •