Base | Representation |
---|---|
bin | 1000010100111000011… |
… | …1000101101110110101 |
3 | 111200020000021112022120 |
4 | 2011032013011232311 |
5 | 4320423331331401 |
6 | 145414053550153 |
7 | 13222526233116 |
oct | 2051607055665 |
9 | 450200245276 |
10 | 143044402101 |
11 | 55734921537 |
12 | 23881345359 |
13 | 10648521963 |
14 | 6ccdab220d |
15 | 3ac3136836 |
hex | 214e1c5bb5 |
143044402101 has 8 divisors (see below), whose sum is σ = 190769964864. Its totient is φ = 95340887040.
The previous prime is 143044402087. The next prime is 143044402141. The reversal of 143044402101 is 101204440341.
143044402101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143044402101 - 219 = 143043877813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143044402141) 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, 5496780 + ... + 5522741.
It is an arithmetic number, because the mean of its divisors is an integer number (23846245608).
Almost surely, 2143044402101 is an apocalyptic number.
It is an amenable number.
143044402101 is a deficient number, since it is larger than the sum of its proper divisors (47725562763).
143044402101 is a wasteful number, since it uses less digits than its factorization.
143044402101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11023851.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 143044402101 its reverse (101204440341), we get a palindrome (244248842442).
The spelling of 143044402101 in words is "one hundred forty-three billion, forty-four million, four hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •