Base | Representation |
---|---|
bin | 1000011010010011011… |
… | …1111100100001101001 |
3 | 111210222110100002212122 |
4 | 2012210313330201221 |
5 | 4331414003100100 |
6 | 150214333321025 |
7 | 13303563105452 |
oct | 2064467744151 |
9 | 453873302778 |
10 | 144500050025 |
11 | 56311569351 |
12 | 24008936175 |
13 | 1081ac854a6 |
14 | 6dcb14c129 |
15 | 3b5ad1e985 |
hex | 21a4dfc869 |
144500050025 has 12 divisors (see below), whose sum is σ = 179217672192. Its totient is φ = 115575775440.
The previous prime is 144500049949. The next prime is 144500050061. The reversal of 144500050025 is 520050005441.
144500050025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 144500050025 - 28 = 144500049769 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144500049976 and 144500050003.
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 11 ways as a sum of consecutive naturals, for example, 484649 + ... + 723798.
It is an arithmetic number, because the mean of its divisors is an integer number (14934806016).
Almost surely, 2144500050025 is an apocalyptic number.
It is an amenable number.
144500050025 is a deficient number, since it is larger than the sum of its proper divisors (34717622167).
144500050025 is a wasteful number, since it uses less digits than its factorization.
144500050025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213240 (or 1213235 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 26.
Adding to 144500050025 its reverse (520050005441), we get a palindrome (664550055466).
The spelling of 144500050025 in words is "one hundred forty-four billion, five hundred million, fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •