Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …1011100011000111010011 |
3 | 1022102002121122011001221202 |
4 | 2101202100223203013103 |
5 | 2302324233431401321 |
6 | 33134240321541415 |
7 | 2051361600366125 |
oct | 221422053430723 |
9 | 38362548131852 |
10 | 10001111200211 |
11 | 32064a15a91aa |
12 | 1156347aa486b |
13 | 57714042b141 |
14 | 2680b0945215 |
15 | 12524278c70b |
hex | 91890ae31d3 |
10001111200211 has 2 divisors, whose sum is σ = 10001111200212. Its totient is φ = 10001111200210.
The previous prime is 10001111200193. The next prime is 10001111200231. The reversal of 10001111200211 is 11200211110001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10001111200211 - 230 = 10000037458387 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001111200192 and 10001111200201.
It is not a weakly prime, because it can be changed into another prime (10001111200231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000555600105 + 5000555600106.
It is an arithmetic number, because the mean of its divisors is an integer number (5000555600106).
Almost surely, 210001111200211 is an apocalyptic number.
10001111200211 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001111200211 is an equidigital number, since it uses as much as digits as its factorization.
10001111200211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10001111200211 its reverse (11200211110001), we get a palindrome (21201322310212).
The spelling of 10001111200211 in words is "ten trillion, one billion, one hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •