Base | Representation |
---|---|
bin | 1010000000011001101011… |
… | …1110000111110001111000 |
3 | 1102221210010002010022000020 |
4 | 2200012122332013301320 |
5 | 2420224104333033422 |
6 | 35222130523010440 |
7 | 2213604044241612 |
oct | 240063276076170 |
9 | 42853102108006 |
10 | 11002011221112 |
11 | 3561a2157011a |
12 | 129831b369a20 |
13 | 61a63ccc9a12 |
14 | 2a0700711db2 |
15 | 1412c303695c |
hex | a019af87c78 |
11002011221112 has 64 divisors (see below), whose sum is σ = 27955262570400. Its totient is φ = 3607724144640.
The previous prime is 11002011221093. The next prime is 11002011221183. The reversal of 11002011221112 is 21112211020011.
It is a happy number.
It is a super-2 number, since 2×110020112211122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11002011221091 and 11002011221100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12652189 + ... + 13493772.
Almost surely, 211002011221112 is an apocalyptic number.
11002011221112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11002011221112 is an abundant number, since it is smaller than the sum of its proper divisors (16953251349288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002011221112 is a wasteful number, since it uses less digits than its factorization.
11002011221112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26146256 (or 26146252 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11002011221112 its reverse (21112211020011), we get a palindrome (32114222241123).
The spelling of 11002011221112 in words is "eleven trillion, two billion, eleven million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •