Base | Representation |
---|---|
bin | 1010000000010110101101… |
… | …0110001011001011010000 |
3 | 1102221201001101122211200121 |
4 | 2200011223112023023100 |
5 | 2420220440312020422 |
6 | 35221515341400024 |
7 | 2213545202655622 |
oct | 240055326131320 |
9 | 42851041584617 |
10 | 11001212220112 |
11 | 3561651551914 |
12 | 1298137869014 |
13 | 61a54360676a |
14 | 2a0666566c12 |
15 | 141277d0a8c7 |
hex | a016b58b2d0 |
11001212220112 has 20 divisors (see below), whose sum is σ = 22002424441216. Its totient is φ = 5323167203040.
The previous prime is 11001212219989. The next prime is 11001212220121. The reversal of 11001212220112 is 21102221210011.
11001212220112 is an admirable number.
It is a super-3 number, since 3×110012122201123 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11089931178 + ... + 11089932169.
Almost surely, 211001212220112 is an apocalyptic number.
It is an amenable number.
11001212220112 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001212220112 is a wasteful number, since it uses less digits than its factorization.
11001212220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22179863386 (or 22179863380 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11001212220112 its reverse (21102221210011), we get a palindrome (32103433430123).
It can be divided in two parts, 1100121 and 2220112, that added together give a palindrome (3320233).
The spelling of 11001212220112 in words is "eleven trillion, one billion, two hundred twelve million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •