Base | Representation |
---|---|
bin | 1010000001100100100011… |
… | …1100111000010001010100 |
3 | 1110000200222210112001201011 |
4 | 2200121020330320101110 |
5 | 2421041240130001322 |
6 | 35235253141342004 |
7 | 2215215106114333 |
oct | 240311074702124 |
9 | 43020883461634 |
10 | 11022110000212 |
11 | 356a4a5827363 |
12 | 12a01aa407904 |
13 | 61c4c3cab50c |
14 | 2a1689b8bd1a |
15 | 141a9c7b5677 |
hex | a0648f38454 |
11022110000212 has 48 divisors (see below), whose sum is σ = 20014640352000. Its totient is φ = 5304807615744.
The previous prime is 11022110000191. The next prime is 11022110000233. The reversal of 11022110000212 is 21200001122011.
It is an interprime number because it is at equal distance from previous prime (11022110000191) and next prime (11022110000233).
It is a junction number, because it is equal to n+sod(n) for n = 11022110000192 and 11022110000201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 168917089 + ... + 168982327.
It is an arithmetic number, because the mean of its divisors is an integer number (416971674000).
Almost surely, 211022110000212 is an apocalyptic number.
It is an amenable number.
11022110000212 is a deficient number, since it is larger than the sum of its proper divisors (8992530351788).
11022110000212 is a wasteful number, since it uses less digits than its factorization.
11022110000212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69688 (or 69686 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11022110000212 its reverse (21200001122011), we get a palindrome (32222111122223).
The spelling of 11022110000212 in words is "eleven trillion, twenty-two billion, one hundred ten million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •