Base | Representation |
---|---|
bin | 1001101001010010111001… |
… | …00010101011011010010111 |
3 | 2210002122222102011202221122 |
4 | 10310221130202223122113 |
5 | 10240001241340232411 |
6 | 113035441432234155 |
7 | 4316244035462366 |
oct | 464513442533227 |
9 | 83078872152848 |
10 | 21210101102231 |
11 | 68381761427a8 |
12 | 24667abb3b95b |
13 | bab1474c72c2 |
14 | 5348081057dd |
15 | 26bacb7509db |
hex | 134a5c8ab697 |
21210101102231 has 2 divisors, whose sum is σ = 21210101102232. Its totient is φ = 21210101102230.
The previous prime is 21210101102131. The next prime is 21210101102237. The reversal of 21210101102231 is 13220110101212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21210101102231 - 210 = 21210101101207 is a prime.
It is a super-2 number, since 2×212101011022312 (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 (21210101102237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605050551115 + 10605050551116.
It is an arithmetic number, because the mean of its divisors is an integer number (10605050551116).
Almost surely, 221210101102231 is an apocalyptic number.
21210101102231 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210101102231 is an equidigital number, since it uses as much as digits as its factorization.
21210101102231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 21210101102231 its reverse (13220110101212), we get a palindrome (34430211203443).
The spelling of 21210101102231 in words is "twenty-one trillion, two hundred ten billion, one hundred one million, one hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •