Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …1010110111001010100011 |
3 | 1102221121110121201002220102 |
4 | 2200010233222313022203 |
5 | 2420211413004311321 |
6 | 35221232134133015 |
7 | 2213511324555413 |
oct | 240045752671243 |
9 | 42847417632812 |
10 | 11000211010211 |
11 | 3561188382015 |
12 | 1297ab84b116b |
13 | 61a414064977 |
14 | 2a05ad5c2643 |
15 | 141219e8ac0b |
hex | a012fab72a3 |
11000211010211 has 2 divisors, whose sum is σ = 11000211010212. Its totient is φ = 11000211010210.
The previous prime is 11000211010153. The next prime is 11000211010259. The reversal of 11000211010211 is 11201011200011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000211010211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000211010192 and 11000211010201.
It is not a weakly prime, because it can be changed into another prime (11000211010111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500105505105 + 5500105505106.
It is an arithmetic number, because the mean of its divisors is an integer number (5500105505106).
Almost surely, 211000211010211 is an apocalyptic number.
11000211010211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000211010211 is an equidigital number, since it uses as much as digits as its factorization.
11000211010211 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 11000211010211 its reverse (11201011200011), we get a palindrome (22201222210222).
The spelling of 11000211010211 in words is "eleven trillion, two hundred eleven million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •