Base | Representation |
---|---|
bin | 1001101001010010111001… |
… | …00110100011011001110001 |
3 | 2210002122222111002101022202 |
4 | 10310221130212203121301 |
5 | 10240001242120234001 |
6 | 113035441510112545 |
7 | 4316244050222666 |
oct | 464513446433161 |
9 | 83078874071282 |
10 | 21210102118001 |
11 | 6838176776985 |
12 | 24667b034b755 |
13 | bab147791754 |
14 | 5348082cba6d |
15 | 26bacb8a196b |
hex | 134a5c9a3671 |
21210102118001 has 2 divisors, whose sum is σ = 21210102118002. Its totient is φ = 21210102118000.
The previous prime is 21210102117991. The next prime is 21210102118069. The reversal of 21210102118001 is 10081120101212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18226965183025 + 2983136934976 = 4269305^2 + 1727176^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210102118001 - 210 = 21210102116977 is a prime.
It is a super-2 number, since 2×212101021180012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21210102118091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605051059000 + 10605051059001.
It is an arithmetic number, because the mean of its divisors is an integer number (10605051059001).
Almost surely, 221210102118001 is an apocalyptic number.
It is an amenable number.
21210102118001 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210102118001 is an equidigital number, since it uses as much as digits as its factorization.
21210102118001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 21210102118001 its reverse (10081120101212), we get a palindrome (31291222219213).
The spelling of 21210102118001 in words is "twenty-one trillion, two hundred ten billion, one hundred two million, one hundred eighteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •