Base | Representation |
---|---|
bin | 1001101001010100110001… |
… | …01111111001010101100101 |
3 | 2210002202120210212001201212 |
4 | 10310222120233321111211 |
5 | 10240010323431400401 |
6 | 113040125554201205 |
7 | 4316311052251214 |
oct | 464523057712545 |
9 | 83082523761655 |
10 | 21211111200101 |
11 | 6838644333229 |
12 | 2466a32283205 |
13 | bab27885b754 |
14 | 5348a232107b |
15 | 26bb3a278dbb |
hex | 134a98bf9565 |
21211111200101 has 2 divisors, whose sum is σ = 21211111200102. Its totient is φ = 21211111200100.
The previous prime is 21211111200073. The next prime is 21211111200137. The reversal of 21211111200101 is 10100211111212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20452689676225 + 758421523876 = 4522465^2 + 870874^2 .
It is a cyclic number.
It is not a de Polignac number, because 21211111200101 - 218 = 21211110937957 is a prime.
It is a super-2 number, since 2×212111112001012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21211111200151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605555600050 + 10605555600051.
It is an arithmetic number, because the mean of its divisors is an integer number (10605555600051).
Almost surely, 221211111200101 is an apocalyptic number.
It is an amenable number.
21211111200101 is a deficient number, since it is larger than the sum of its proper divisors (1).
21211111200101 is an equidigital number, since it uses as much as digits as its factorization.
21211111200101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21211111200101 its reverse (10100211111212), we get a palindrome (31311322311313).
The spelling of 21211111200101 in words is "twenty-one trillion, two hundred eleven billion, one hundred eleven million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •