Base | Representation |
---|---|
bin | 10001010000110… |
… | …00010110100000 |
3 | 101002110202200200 |
4 | 20220120112200 |
5 | 244032200412 |
6 | 22211345200 |
7 | 3405543600 |
oct | 1050302640 |
9 | 332422620 |
10 | 144803232 |
11 | 748128a2 |
12 | 405b2200 |
13 | 23ccc6b2 |
14 | 15334c00 |
15 | caa49dc |
hex | 8a185a0 |
144803232 has 216 divisors, whose sum is σ = 495960192. Its totient is φ = 39916800.
The previous prime is 144803227. The next prime is 144803233. The reversal of 144803232 is 232308441.
It is a junction number, because it is equal to n+sod(n) for n = 144803196 and 144803205.
It is not an unprimeable number, because it can be changed into a prime (144803233) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 437307 + ... + 437637.
It is an arithmetic number, because the mean of its divisors is an integer number (2296112).
Almost surely, 2144803232 is an apocalyptic number.
144803232 is a gapful number since it is divisible by the number (12) 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 144803232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247980096).
144803232 is an abundant number, since it is smaller than the sum of its proper divisors (351156960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144803232 is a wasteful number, since it uses less digits than its factorization.
144803232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392 (or 374 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 144803232 is about 12033.4214585877. The cubic root of 144803232 is about 525.1210387590.
The spelling of 144803232 in words is "one hundred forty-four million, eight hundred three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •