Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …0001101101010101000101 |
3 | 1102221121102212102000021211 |
4 | 2200010233001231111011 |
5 | 2420211402224101041 |
6 | 35221231111011421 |
7 | 2213511134064103 |
oct | 240045701552505 |
9 | 42847385360254 |
10 | 11000200222021 |
11 | 356118228375a |
12 | 1297ab4969b71 |
13 | 61a411a5841a |
14 | 2a05abdb4c73 |
15 | 141219059481 |
hex | a012f06d545 |
11000200222021 has 8 divisors (see below), whose sum is σ = 11003361717600. Its totient is φ = 10997039006640.
The previous prime is 11000200222001. The next prime is 11000200222057. The reversal of 11000200222021 is 12022200200011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000200222021 - 223 = 11000191833413 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000200221992 and 11000200222010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000200222001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97308510 + ... + 97421488.
It is an arithmetic number, because the mean of its divisors is an integer number (1375420214700).
Almost surely, 211000200222021 is an apocalyptic number.
It is an amenable number.
11000200222021 is a deficient number, since it is larger than the sum of its proper divisors (3161495579).
11000200222021 is a wasteful number, since it uses less digits than its factorization.
11000200222021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140099.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 11000200222021 its reverse (12022200200011), we get a palindrome (23022400422032).
The spelling of 11000200222021 in words is "eleven trillion, two hundred million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •