Base | Representation |
---|---|
bin | 11111001101000100000… |
… | …111010101100000101001 |
3 | 21120222220010221102021012 |
4 | 133031010013111200221 |
5 | 240113042323021010 |
6 | 4321031532553305 |
7 | 310631350424432 |
oct | 37150407254051 |
9 | 7528803842235 |
10 | 2144331454505 |
11 | 757451226899 |
12 | 2a7704322835 |
13 | 1272956098a6 |
14 | 75b01472489 |
15 | 3aba40e8005 |
hex | 1f3441d5829 |
2144331454505 has 8 divisors (see below), whose sum is σ = 2573923224192. Its totient is φ = 1714981511088.
The previous prime is 2144331454501. The next prime is 2144331454513. The reversal of 2144331454505 is 5054541334412.
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 2144331454505 - 22 = 2144331454501 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2144331454501) 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, 60437057 + ... + 60472526.
It is an arithmetic number, because the mean of its divisors is an integer number (321740403024).
Almost surely, 22144331454505 is an apocalyptic number.
It is an amenable number.
2144331454505 is a deficient number, since it is larger than the sum of its proper divisors (429591769687).
2144331454505 is a wasteful number, since it uses less digits than its factorization.
2144331454505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120913135.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 2144331454505 its reverse (5054541334412), we get a palindrome (7198872788917).
The spelling of 2144331454505 in words is "two trillion, one hundred forty-four billion, three hundred thirty-one million, four hundred fifty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •