Base | Representation |
---|---|
bin | 100000100100000000000011… |
… | …001000010010111001001011 |
3 | 200210001212202121222112201210 |
4 | 200210000003020102321023 |
5 | 122232334013124232021 |
6 | 1224330232254544203 |
7 | 42110454016062564 |
oct | 4044000310227113 |
9 | 623055677875653 |
10 | 143211442024011 |
11 | 416a46a4565109 |
12 | 1408b406208063 |
13 | 61baa1cc2057a |
14 | 2751683b5916b |
15 | 11853d1958e76 |
hex | 824003212e4b |
143211442024011 has 8 divisors (see below), whose sum is σ = 192052338437520. Its totient is φ = 94922420146592.
The previous prime is 143211442024009. The next prime is 143211442024033. The reversal of 143211442024011 is 110420244112341.
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 143211442024011 - 21 = 143211442024009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143211442024011.
It is not an unprimeable number, because it can be changed into a prime (143211442024411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 137968633416 + ... + 137968634453.
It is an arithmetic number, because the mean of its divisors is an integer number (24006542304690).
Almost surely, 2143211442024011 is an apocalyptic number.
143211442024011 is a deficient number, since it is larger than the sum of its proper divisors (48840896413509).
143211442024011 is a wasteful number, since it uses less digits than its factorization.
143211442024011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275937268045.
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 143211442024011 its reverse (110420244112341), we get a palindrome (253631686136352).
The spelling of 143211442024011 in words is "one hundred forty-three trillion, two hundred eleven billion, four hundred forty-two million, twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •