Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …0111011011011100000101 |
3 | 1102221121110120000101100011 |
4 | 2200010233213123130011 |
5 | 2420211412242011323 |
6 | 35221232102550221 |
7 | 2213511314116462 |
oct | 240045747333405 |
9 | 42847416011304 |
10 | 11000210110213 |
11 | 3561187917915 |
12 | 1297ab8138371 |
13 | 61a413b0b11c |
14 | 2a05ad42a669 |
15 | 141219d5e20d |
hex | a012f9db705 |
11000210110213 has 2 divisors, whose sum is σ = 11000210110214. Its totient is φ = 11000210110212.
The previous prime is 11000210110189. The next prime is 11000210110243. The reversal of 11000210110213 is 31201101200011.
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., 9948586523044 + 1051623587169 = 3154138^2 + 1025487^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000210110213 - 221 = 11000208013061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000210110193 and 11000210110202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11000210110243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500105055106 + 5500105055107.
It is an arithmetic number, because the mean of its divisors is an integer number (5500105055107).
Almost surely, 211000210110213 is an apocalyptic number.
It is an amenable number.
11000210110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000210110213 is an equidigital number, since it uses as much as digits as its factorization.
11000210110213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11000210110213 its reverse (31201101200011), we get a palindrome (42201311310224).
The spelling of 11000210110213 in words is "eleven trillion, two hundred ten million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •