Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …0011010111101010101000 |
3 | 1110000121010110020221021011 |
4 | 2200120012303113222220 |
5 | 2421032002023223422 |
6 | 35234551054553304 |
7 | 2215145442060523 |
oct | 240300663275250 |
9 | 43017113227234 |
10 | 11021000211112 |
11 | 3569a86336391 |
12 | 129bb3a808834 |
13 | 61c3780b0c88 |
14 | 2a15c2621bba |
15 | 141a35149077 |
hex | a0606cd7aa8 |
11021000211112 has 8 divisors (see below), whose sum is σ = 20664375395850. Its totient is φ = 5510500105552.
The previous prime is 11021000211079. The next prime is 11021000211119. The reversal of 11021000211112 is 21111200012011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 6436237076676 + 4584763134436 = 2536974^2 + 2141206^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 11021000211092 and 11021000211101.
It is not an unprimeable number, because it can be changed into a prime (11021000211119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 688812513187 + ... + 688812513202.
Almost surely, 211021000211112 is an apocalyptic number.
It is an amenable number.
11021000211112 is a deficient number, since it is larger than the sum of its proper divisors (9643375184738).
11021000211112 is a wasteful number, since it uses less digits than its factorization.
11021000211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377625026395 (or 1377625026391 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11021000211112 its reverse (21111200012011), we get a palindrome (32132200223123).
The spelling of 11021000211112 in words is "eleven trillion, twenty-one billion, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •