Base | Representation |
---|---|
bin | 1000011010011010101… |
… | …1110100100101111000 |
3 | 111211001120111101012100 |
4 | 2012212223310211320 |
5 | 4331444242114412 |
6 | 150221340343400 |
7 | 13304412232023 |
oct | 2064653644570 |
9 | 454046441170 |
10 | 144530426232 |
11 | 56327726455 |
12 | 24016b44b60 |
13 | 1082435c78a |
14 | 6dd11b81ba |
15 | 3b5d81eedc |
hex | 21a6af4978 |
144530426232 has 48 divisors (see below), whose sum is σ = 402015945240. Its totient is φ = 46874731968.
The previous prime is 144530426213. The next prime is 144530426237. The reversal of 144530426232 is 232624035441.
144530426232 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144530426237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27123918 + ... + 27129245.
Almost surely, 2144530426232 is an apocalyptic number.
144530426232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144530426232 is an abundant number, since it is smaller than the sum of its proper divisors (257485519008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144530426232 is a wasteful number, since it uses less digits than its factorization.
144530426232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54253212 (or 54253205 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
The spelling of 144530426232 in words is "one hundred forty-four billion, five hundred thirty million, four hundred twenty-six thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •