Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …0010010111001100100011 |
3 | 1110100010100221210101110111 |
4 | 2201223023202113030203 |
5 | 2424012142223211321 |
6 | 35343542220312151 |
7 | 2224454055415114 |
oct | 241531342271443 |
9 | 43303327711414 |
10 | 11110200210211 |
11 | 35a389a415a03 |
12 | 12b52936a2657 |
13 | 6278c224cb2b |
14 | 2a5a4519420b |
15 | 14400614d5e1 |
hex | a1acb897323 |
11110200210211 has 2 divisors, whose sum is σ = 11110200210212. Its totient is φ = 11110200210210.
The previous prime is 11110200210149. The next prime is 11110200210251. The reversal of 11110200210211 is 11201200201111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11110200210211 - 29 = 11110200209699 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11110200210191 and 11110200210200.
It is not a weakly prime, because it can be changed into another prime (11110200210251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555100105105 + 5555100105106.
It is an arithmetic number, because the mean of its divisors is an integer number (5555100105106).
Almost surely, 211110200210211 is an apocalyptic number.
11110200210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110200210211 is an equidigital number, since it uses as much as digits as its factorization.
11110200210211 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 11110200210211 its reverse (11201200201111), we get a palindrome (22311400411322).
The spelling of 11110200210211 in words is "eleven trillion, one hundred ten billion, two hundred million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •