Base | Representation |
---|---|
bin | 100000110110001110111100… |
… | …000010011101110011001001 |
3 | 200221111122211000101110212122 |
4 | 200312032330002131303021 |
5 | 122413401022204421123 |
6 | 1231130004143021025 |
7 | 42300131001125006 |
oct | 4066167402356311 |
9 | 627448730343778 |
10 | 144464379763913 |
11 | 42037aaa21a770 |
12 | 142521b859a775 |
13 | 627bc17aa0911 |
14 | 2796182c108ad |
15 | 11a7cb3d80bc8 |
hex | 8363bc09dcc9 |
144464379763913 has 8 divisors (see below), whose sum is σ = 165892110733920. Its totient is φ = 124419083050080.
The previous prime is 144464379763901. The next prime is 144464379763943. The reversal of 144464379763913 is 319367973464441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144464379763913 - 210 = 144464379762889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144464379763943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 345608563820 + ... + 345608564237.
It is an arithmetic number, because the mean of its divisors is an integer number (20736513841740).
Almost surely, 2144464379763913 is an apocalyptic number.
It is an amenable number.
144464379763913 is a deficient number, since it is larger than the sum of its proper divisors (21427730970007).
144464379763913 is a wasteful number, since it uses less digits than its factorization.
144464379763913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 691217128087.
The product of its digits is 987614208, while the sum is 71.
The spelling of 144464379763913 in words is "one hundred forty-four trillion, four hundred sixty-four billion, three hundred seventy-nine million, seven hundred sixty-three thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •