Base | Representation |
---|---|
bin | 100000110100010010110110… |
… | …100101100000010111110111 |
3 | 200221000220220121100122011220 |
4 | 200310102312211200113313 |
5 | 122404210140420100043 |
6 | 1230544451244401423 |
7 | 42254403206304222 |
oct | 4064226645402767 |
9 | 627026817318156 |
10 | 144331144300023 |
11 | 41a9654928573a |
12 | 14230414246273 |
13 | 626c4a37c1615 |
14 | 278d943b685b9 |
15 | 11a45b6e66483 |
hex | 8344b69605f7 |
144331144300023 has 8 divisors (see below), whose sum is σ = 192441657168000. Its totient is φ = 96220697149368.
The previous prime is 144331144300019. The next prime is 144331144300111. The reversal of 144331144300023 is 320003441133441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144331144300023 - 22 = 144331144300019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144331144380023) 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, 11053473 + ... + 20269226.
It is an arithmetic number, because the mean of its divisors is an integer number (24055207146000).
Almost surely, 2144331144300023 is an apocalyptic number.
144331144300023 is a deficient number, since it is larger than the sum of its proper divisors (48110512867977).
144331144300023 is a wasteful number, since it uses less digits than its factorization.
144331144300023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32858661.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 144331144300023 its reverse (320003441133441), we get a palindrome (464334585433464).
The spelling of 144331144300023 in words is "one hundred forty-four trillion, three hundred thirty-one billion, one hundred forty-four million, three hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •