Base | Representation |
---|---|
bin | 1010000110001110111010… |
… | …1100000011110000101100 |
3 | 1110022100201102000121122210 |
4 | 2201203232230003300230 |
5 | 2423344301201120022 |
6 | 35340140312410420 |
7 | 2224051603053333 |
oct | 241435654036054 |
9 | 43270642017583 |
10 | 11102200020012 |
11 | 35a0464528672 |
12 | 12b38203a6a10 |
13 | 626c1897128a |
14 | 2a54c687ad1a |
15 | 143bd8b16a0c |
hex | a18eeb03c2c |
11102200020012 has 24 divisors (see below), whose sum is σ = 25926489665776. Its totient is φ = 3697682442048.
The previous prime is 11102200019993. The next prime is 11102200020053. The reversal of 11102200020012 is 21002000220111.
It is a super-3 number, since 3×111022000200123 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 11102200020012.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 381347083 + ... + 381376194.
Almost surely, 211102200020012 is an apocalyptic number.
11102200020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11102200020012 is an abundant number, since it is smaller than the sum of its proper divisors (14824289645764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102200020012 is a wasteful number, since it uses less digits than its factorization.
11102200020012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 762724497 (or 762724495 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11102200020012 its reverse (21002000220111), we get a palindrome (32104200240123).
The spelling of 11102200020012 in words is "eleven trillion, one hundred two billion, two hundred million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •