Base | Representation |
---|---|
bin | 1001101001010010111001… |
… | …00011000101110000000000 |
3 | 2210002122222102101020221020 |
4 | 10310221130203011300000 |
5 | 10240001241402210422 |
6 | 113035441434425440 |
7 | 4316244036422043 |
oct | 464513443056000 |
9 | 83078872336836 |
10 | 21210101210112 |
11 | 6838176206861 |
12 | 24667abb92280 |
13 | bab147534439 |
14 | 534808132c5a |
15 | 26bacb77295c |
hex | 134a5c8c5c00 |
21210101210112 has 44 divisors (see below), whose sum is σ = 56532652582536. Its totient is φ = 7070033735680.
The previous prime is 21210101210107. The next prime is 21210101210119. The reversal of 21210101210112 is 21101210101212.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21210101210091 and 21210101210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21210101210119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3452161839 + ... + 3452167982.
Almost surely, 221210101210112 is an apocalyptic number.
It is an amenable number.
21210101210112 is an abundant number, since it is smaller than the sum of its proper divisors (35322551372424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210101210112 is an equidigital number, since it uses as much as digits as its factorization.
21210101210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6904329844 (or 6904329826 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 21210101210112 its reverse (21101210101212), we get a palindrome (42311311311324).
The spelling of 21210101210112 in words is "twenty-one trillion, two hundred ten billion, one hundred one million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •