Base | Representation |
---|---|
bin | 1000011011101011110… |
… | …1011000100010001011 |
3 | 111211221021112200111221 |
4 | 2012322331120202023 |
5 | 4333143331333334 |
6 | 150315211102511 |
7 | 13316012364100 |
oct | 2067275304213 |
9 | 454837480457 |
10 | 144870574219 |
11 | 56491731698 |
12 | 240b0a41a37 |
13 | 10879976587 |
14 | 702443caa7 |
15 | 3b7d60e8b4 |
hex | 21baf5888b |
144870574219 has 12 divisors (see below), whose sum is σ = 168583237848. Its totient is φ = 124130328000.
The previous prime is 144870574183. The next prime is 144870574271. The reversal of 144870574219 is 912475078441.
144870574219 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 144870574219 - 215 = 144870541451 is a prime.
It is a super-2 number, since 2×1448705742192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144870574319) 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, 390517 + ... + 665014.
It is an arithmetic number, because the mean of its divisors is an integer number (14048603154).
Almost surely, 2144870574219 is an apocalyptic number.
144870574219 is a deficient number, since it is larger than the sum of its proper divisors (23712663629).
144870574219 is a wasteful number, since it uses less digits than its factorization.
144870574219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1058346 (or 1058339 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 52.
The spelling of 144870574219 in words is "one hundred forty-four billion, eight hundred seventy million, five hundred seventy-four thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •