Base | Representation |
---|---|
bin | 1001100011001011111011… |
… | …00001110011001000110110 |
3 | 2202100121012010100000011000 |
4 | 10301211331201303020312 |
5 | 10223031402441403413 |
6 | 112355205331224130 |
7 | 4265133363211323 |
oct | 461457541631066 |
9 | 82317163300130 |
10 | 21000201122358 |
11 | 6767154072157 |
12 | 2431b90a48046 |
13 | b9440613a693 |
14 | 5285b5299b4a |
15 | 2663e40c9073 |
hex | 13197d873236 |
21000201122358 has 96 divisors (see below), whose sum is σ = 52149758865120. Its totient is φ = 6241545745920.
The previous prime is 21000201122357. The next prime is 21000201122363. The reversal of 21000201122358 is 85322110200012.
21000201122358 is a `hidden beast` number, since 2 + 100 + 0 + 201 + 1 + 2 + 2 + 358 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000201122357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31352863 + ... + 32015658.
It is an arithmetic number, because the mean of its divisors is an integer number (543226654845).
Almost surely, 221000201122358 is an apocalyptic number.
21000201122358 is an abundant number, since it is smaller than the sum of its proper divisors (31149557742762).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000201122358 is a wasteful number, since it uses less digits than its factorization.
21000201122358 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63368587 (or 63368562 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The spelling of 21000201122358 in words is "twenty-one trillion, two hundred one million, one hundred twenty-two thousand, three hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •