Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1011100111111111100011 |
3 | 1102221121110122002021020211 |
4 | 2200010233223213333203 |
5 | 2420211413032211321 |
6 | 35221232142314551 |
7 | 2213511326350456 |
oct | 240045753477743 |
9 | 42847418067224 |
10 | 11000211210211 |
11 | 35611884a9303 |
12 | 1297ab8588a57 |
13 | 61a414104a02 |
14 | 2a05ad63549d |
15 | 141219eca0e1 |
hex | a012fae7fe3 |
11000211210211 has 2 divisors, whose sum is σ = 11000211210212. Its totient is φ = 11000211210210.
The previous prime is 11000211210161. The next prime is 11000211210281. The reversal of 11000211210211 is 11201211200011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11000211210211 - 221 = 11000209113059 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000211210191 and 11000211210200.
It is not a weakly prime, because it can be changed into another prime (11000211210281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500105605105 + 5500105605106.
It is an arithmetic number, because the mean of its divisors is an integer number (5500105605106).
Almost surely, 211000211210211 is an apocalyptic number.
11000211210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000211210211 is an equidigital number, since it uses as much as digits as its factorization.
11000211210211 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 11000211210211 its reverse (11201211200011), we get a palindrome (22201422410222).
The spelling of 11000211210211 in words is "eleven trillion, two hundred eleven million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •