Base | Representation |
---|---|
bin | 100000110011110110001110… |
… | …010100101100001000001011 |
3 | 200220220222120021010020000000 |
4 | 200303312032110230020023 |
5 | 122403204211413011021 |
6 | 1230522405050014043 |
7 | 42252234350321463 |
oct | 4063661624541013 |
9 | 626828507106000 |
10 | 144300404032011 |
11 | 41a84504199367 |
12 | 14226475417323 |
13 | 6269614c5b616 |
14 | 278c2692a2ba3 |
15 | 11a38b8363b26 |
hex | 833d8e52c20b |
144300404032011 has 32 divisors (see below), whose sum is σ = 218332816069440. Its totient is φ = 95348939374080.
The previous prime is 144300404031991. The next prime is 144300404032111. The reversal of 144300404032011 is 110230404003441.
144300404032011 is a `hidden beast` number, since 14 + 4 + 3 + 0 + 0 + 40 + 403 + 201 + 1 = 666.
It is not a de Polignac number, because 144300404032011 - 211 = 144300404029963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (144300404032111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 291704110 + ... + 292198371.
It is an arithmetic number, because the mean of its divisors is an integer number (6822900502170).
Almost surely, 2144300404032011 is an apocalyptic number.
144300404032011 is a deficient number, since it is larger than the sum of its proper divisors (74032412037429).
144300404032011 is an frugal number, since it uses more digits than its factorization.
144300404032011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583902615 (or 583902597 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 144300404032011 its reverse (110230404003441), we get a palindrome (254530808035452).
The spelling of 144300404032011 in words is "one hundred forty-four trillion, three hundred billion, four hundred four million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •