Base | Representation |
---|---|
bin | 100000111000010001111011… |
… | …000100010010010110110000 |
3 | 200222000002211201122210202111 |
4 | 200320101323010102112300 |
5 | 122423202042023034211 |
6 | 1231314344125255104 |
7 | 42313240201305664 |
oct | 4070217304222660 |
9 | 628002751583674 |
10 | 144605023643056 |
11 | 42091712001829 |
12 | 14275509a04494 |
13 | 628c26cb82892 |
14 | 279ccc5b688a4 |
15 | 11ab79638b421 |
hex | 83847b1125b0 |
144605023643056 has 40 divisors (see below), whose sum is σ = 282559862823840. Its totient is φ = 71688530479104.
The previous prime is 144605023643053. The next prime is 144605023643111. The reversal of 144605023643056 is 650346320506441.
It is a super-2 number, since 2×1446050236430562 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (144605023643053) 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, 67098721 + ... + 69220288.
It is an arithmetic number, because the mean of its divisors is an integer number (7063996570596).
Almost surely, 2144605023643056 is an apocalyptic number.
144605023643056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
144605023643056 is a deficient number, since it is larger than the sum of its proper divisors (137954839180784).
144605023643056 is a wasteful number, since it uses less digits than its factorization.
144605023643056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136319581 (or 136319575 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 49.
The spelling of 144605023643056 in words is "one hundred forty-four trillion, six hundred five billion, twenty-three million, six hundred forty-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •