Base | Representation |
---|---|
bin | 1010000000010010111110… |
… | …0111011011011100001101 |
3 | 1102221121110120000101100110 |
4 | 2200010233213123130031 |
5 | 2420211412242011341 |
6 | 35221232102550233 |
7 | 2213511314116503 |
oct | 240045747333415 |
9 | 42847416011313 |
10 | 11000210110221 |
11 | 3561187917922 |
12 | 1297ab8138379 |
13 | 61a413b0b127 |
14 | 2a05ad42a673 |
15 | 141219d5e216 |
hex | a012f9db70d |
11000210110221 has 16 divisors (see below), whose sum is σ = 14675063875200. Its totient is φ = 7329415876608.
The previous prime is 11000210110213. The next prime is 11000210110243. The reversal of 11000210110221 is 12201101200011.
11000210110221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11000210110221 - 23 = 11000210110213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000210110197 and 11000210110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000210110621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45368905 + ... + 45610721.
It is an arithmetic number, because the mean of its divisors is an integer number (917191492200).
Almost surely, 211000210110221 is an apocalyptic number.
It is an amenable number.
11000210110221 is a deficient number, since it is larger than the sum of its proper divisors (3674853764979).
11000210110221 is a wasteful number, since it uses less digits than its factorization.
11000210110221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250148.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11000210110221 its reverse (12201101200011), we get a palindrome (23201311310232).
The spelling of 11000210110221 in words is "eleven trillion, two hundred ten million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •