Base | Representation |
---|---|
bin | 10110110000110101110011… |
… | …100011001111100100110111 |
3 | 111010110202000012012011011100 |
4 | 112300311303203033210313 |
5 | 101110224100304234033 |
6 | 552531232434141143 |
7 | 30041643451365240 |
oct | 2660656343174467 |
9 | 433422005164140 |
10 | 100113331321143 |
11 | 29998909644158 |
12 | b28a7741217b3 |
13 | 43b285387059a |
14 | 1aa1722605cc7 |
15 | b8929e0a5513 |
hex | 5b0d738cf937 |
100113331321143 has 24 divisors (see below), whose sum is σ = 174988007689248. Its totient is φ = 53842463903232.
The previous prime is 100113331321141. The next prime is 100113331321151. The reversal of 100113331321143 is 341123133311001.
100113331321143 is a `hidden beast` number, since 1 + 0 + 0 + 1 + 1 + 3 + 331 + 321 + 1 + 4 + 3 = 666.
It is not a de Polignac number, because 100113331321143 - 21 = 100113331321141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100113331321141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46738248846 + ... + 46738250987.
It is an arithmetic number, because the mean of its divisors is an integer number (7291166987052).
Almost surely, 2100113331321143 is an apocalyptic number.
100113331321143 is a deficient number, since it is larger than the sum of its proper divisors (74874676368105).
100113331321143 is a wasteful number, since it uses less digits than its factorization.
100113331321143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93476499863 (or 93476499860 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 100113331321143 its reverse (341123133311001), we get a palindrome (441236464632144).
The spelling of 100113331321143 in words is "one hundred trillion, one hundred thirteen billion, three hundred thirty-one million, three hundred twenty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •