Base | Representation |
---|---|
bin | 1001100110011000011101… |
… | …10001110100010001010101 |
3 | 2202202002122001020201210111 |
4 | 10303030032301310101111 |
5 | 10231331301110400041 |
6 | 112521450011523021 |
7 | 4306101532032643 |
oct | 463141661642125 |
9 | 82662561221714 |
10 | 21110012200021 |
11 | 67a97846060a8 |
12 | 244b318459471 |
13 | ba188645b504 |
14 | 52da31342193 |
15 | 2691be804981 |
hex | 13330ec74455 |
21110012200021 has 8 divisors (see below), whose sum is σ = 21112626126240. Its totient is φ = 21107398469712.
The previous prime is 21110012200019. The next prime is 21110012200049. The reversal of 21110012200021 is 12000221001112.
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 21110012200021 - 21 = 21110012200019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21110012199974 and 21110012200010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21110012240021) 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, 348670770 + ... + 348731308.
It is an arithmetic number, because the mean of its divisors is an integer number (2639078265780).
Almost surely, 221110012200021 is an apocalyptic number.
It is an amenable number.
21110012200021 is a deficient number, since it is larger than the sum of its proper divisors (2613926219).
21110012200021 is a wasteful number, since it uses less digits than its factorization.
21110012200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97955.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21110012200021 its reverse (12000221001112), we get a palindrome (33110233201133).
The spelling of 21110012200021 in words is "twenty-one trillion, one hundred ten billion, twelve million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •