Base | Representation |
---|---|
bin | 1001000111010011111000… |
… | …1000110110111011011101 |
3 | 1022111000110202001100221011 |
4 | 2101310332020312323131 |
5 | 2303141410002223401 |
6 | 33151402024335221 |
7 | 2053002464562343 |
oct | 221647610667335 |
9 | 38430422040834 |
10 | 10021201211101 |
11 | 3213a70916793 |
12 | 115a214014511 |
13 | 578cc265c952 |
14 | 269058b7b993 |
15 | 125a1b388451 |
hex | 91d3e236edd |
10021201211101 has 2 divisors, whose sum is σ = 10021201211102. Its totient is φ = 10021201211100.
The previous prime is 10021201211081. The next prime is 10021201211123. The reversal of 10021201211101 is 10111210212001.
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., 7966923985476 + 2054277225625 = 2822574^2 + 1433275^2 .
It is an emirp because it is prime and its reverse (10111210212001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10021201211101 - 219 = 10021200686813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10021201211171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010600605550 + 5010600605551.
It is an arithmetic number, because the mean of its divisors is an integer number (5010600605551).
Almost surely, 210021201211101 is an apocalyptic number.
It is an amenable number.
10021201211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021201211101 is an equidigital number, since it uses as much as digits as its factorization.
10021201211101 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 13.
Adding to 10021201211101 its reverse (10111210212001), we get a palindrome (20132411423102).
The spelling of 10021201211101 in words is "ten trillion, twenty-one billion, two hundred one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •