Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0010110111011010100101 |
3 | 1100011020222121112122121112 |
4 | 2110212223102313122211 |
5 | 2314303144321041401 |
6 | 33415155542554405 |
7 | 2102536104145661 |
oct | 224465322673245 |
9 | 40136877478545 |
10 | 10212011112101 |
11 | 3287987056547 |
12 | 118b1a5a38a05 |
13 | 590cb0a00006 |
14 | 27439a4c18a1 |
15 | 12a987ad03bb |
hex | 949ab4b76a5 |
10212011112101 has 2 divisors, whose sum is σ = 10212011112102. Its totient is φ = 10212011112100.
The previous prime is 10212011112049. The next prime is 10212011112137. The reversal of 10212011112101 is 10121111021201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5203371588100 + 5008639524001 = 2281090^2 + 2237999^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212011112101 - 222 = 10212006917797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10212011112161) 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, 5106005556050 + 5106005556051.
It is an arithmetic number, because the mean of its divisors is an integer number (5106005556051).
Almost surely, 210212011112101 is an apocalyptic number.
It is an amenable number.
10212011112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212011112101 is an equidigital number, since it uses as much as digits as its factorization.
10212011112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10212011112101 its reverse (10121111021201), we get a palindrome (20333122133302).
The spelling of 10212011112101 in words is "ten trillion, two hundred twelve billion, eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •