Base | Representation |
---|---|
bin | 1000011011110100001… |
… | …0100110101011001101 |
3 | 111212000201020221222010 |
4 | 2012331002212223031 |
5 | 4333231301403133 |
6 | 150322455411433 |
7 | 13316615255454 |
oct | 2067502465315 |
9 | 455021227863 |
10 | 144905497293 |
11 | 564aa414937 |
12 | 24100683b79 |
13 | 10883c8330b |
14 | 7028d2db9b |
15 | 3b8170c263 |
hex | 21bd0a6acd |
144905497293 has 8 divisors (see below), whose sum is σ = 193212482848. Its totient is φ = 96601088304.
The previous prime is 144905497283. The next prime is 144905497301. The reversal of 144905497293 is 392794509441.
It is a happy number.
144905497293 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 not a de Polignac number, because 144905497293 - 210 = 144905496269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144905497283) 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 7 ways as a sum of consecutive naturals, for example, 508855 + ... + 740772.
It is an arithmetic number, because the mean of its divisors is an integer number (24151560356).
Almost surely, 2144905497293 is an apocalyptic number.
It is an amenable number.
144905497293 is a deficient number, since it is larger than the sum of its proper divisors (48306985555).
144905497293 is a wasteful number, since it uses less digits than its factorization.
144905497293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1288283.
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 144905497293 in words is "one hundred forty-four billion, nine hundred five million, four hundred ninety-seven thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.990 sec. • engine limits •