Base | Representation |
---|---|
bin | 1000011001110000010… |
… | …0111000111111010110 |
3 | 111210121011121011121101 |
4 | 2012130010320333112 |
5 | 4331113211322340 |
6 | 150151541540314 |
7 | 13300121365306 |
oct | 2063404707726 |
9 | 453534534541 |
10 | 144352448470 |
11 | 5624621509a |
12 | 23b8741469a |
13 | 107c65161a9 |
14 | 6db56c9606 |
15 | 3b4cdb5c9a |
hex | 219c138fd6 |
144352448470 has 8 divisors (see below), whose sum is σ = 259834407264. Its totient is φ = 57740979384.
The previous prime is 144352448423. The next prime is 144352448593. The reversal of 144352448470 is 74844253441.
144352448470 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 144352448470.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 7217622414 + ... + 7217622433.
It is an arithmetic number, because the mean of its divisors is an integer number (32479300908).
Almost surely, 2144352448470 is an apocalyptic number.
144352448470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144352448470 is a deficient number, since it is larger than the sum of its proper divisors (115481958794).
144352448470 is a wasteful number, since it uses less digits than its factorization.
144352448470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14435244854.
The product of its (nonzero) digits is 1720320, while the sum is 46.
The spelling of 144352448470 in words is "one hundred forty-four billion, three hundred fifty-two million, four hundred forty-eight thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •