Base | Representation |
---|---|
bin | 1001101001010011000110… |
… | …01010001001001100001001 |
3 | 2210002200021011001121111201 |
4 | 10310221203022021030021 |
5 | 10240002003300023423 |
6 | 113035500435424201 |
7 | 4316246554155424 |
oct | 464514312111411 |
9 | 83080234047451 |
10 | 21210212111113 |
11 | 6838222873383 |
12 | 2466821155061 |
13 | bab1644c392c |
14 | 534818b609bb |
15 | 26bad637c2ad |
hex | 134a63289309 |
21210212111113 has 2 divisors, whose sum is σ = 21210212111114. Its totient is φ = 21210212111112.
The previous prime is 21210212111071. The next prime is 21210212111227. The reversal of 21210212111113 is 31111121201212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13695831820944 + 7514380290169 = 3700788^2 + 2741237^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210212111113 - 29 = 21210212110601 is a prime.
It is not a weakly prime, because it can be changed into another prime (21210212118113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605106055556 + 10605106055557.
It is an arithmetic number, because the mean of its divisors is an integer number (10605106055557).
Almost surely, 221210212111113 is an apocalyptic number.
It is an amenable number.
21210212111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210212111113 is an equidigital number, since it uses as much as digits as its factorization.
21210212111113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 21210212111113 its reverse (31111121201212), we get a palindrome (52321333312325).
Subtracting 21210212111113 from its reverse (31111121201212), we obtain a palindrome (9900909090099).
The spelling of 21210212111113 in words is "twenty-one trillion, two hundred ten billion, two hundred twelve million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •