Base | Representation |
---|---|
bin | 1000010110110100011… |
… | …1101011011000100101 |
3 | 111201120021012212022001 |
4 | 2011231013223120211 |
5 | 4323010022300041 |
6 | 145541440405301 |
7 | 13241444250652 |
oct | 2055507533045 |
9 | 451507185261 |
10 | 143564650021 |
11 | 559815584a1 |
12 | 239a7616831 |
13 | 106cc245c70 |
14 | 6d3cc18c29 |
15 | 3b03b4e131 |
hex | 216d1eb625 |
143564650021 has 32 divisors (see below), whose sum is σ = 164855029248. Its totient is φ = 123849492480.
The previous prime is 143564650003. The next prime is 143564650037. The reversal of 143564650021 is 120056465341.
143564650021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143564650021 is a prime.
It is a super-2 number, since 2×1435646500212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143564656021) 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 31 ways as a sum of consecutive naturals, for example, 56946241 + ... + 56948761.
It is an arithmetic number, because the mean of its divisors is an integer number (5151719664).
Almost surely, 2143564650021 is an apocalyptic number.
It is an amenable number.
143564650021 is a deficient number, since it is larger than the sum of its proper divisors (21290379227).
143564650021 is a wasteful number, since it uses less digits than its factorization.
143564650021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4261.
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 143564650021 in words is "one hundred forty-three billion, five hundred sixty-four million, six hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.829 sec. • engine limits •