Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0000100111100000101100 |
3 | 1102221200210021111121020200 |
4 | 2200011211100213200230 |
5 | 2420220233141200022 |
6 | 35221501252513500 |
7 | 2213542522653444 |
oct | 240054520474054 |
9 | 42850707447220 |
10 | 11001110100012 |
11 | 35615a994253a |
12 | 129810961b890 |
13 | 61a5283ccc76 |
14 | 2a0656b83124 |
15 | 14126dd87bac |
hex | a016542782c |
11001110100012 has 36 divisors (see below), whose sum is σ = 28160366226720. Its totient is φ = 3620618512992.
The previous prime is 11001110099977. The next prime is 11001110100083. The reversal of 11001110100012 is 21000101110011.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11001110099967 and 11001110100003.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1934088243 + ... + 1934093930.
Almost surely, 211001110100012 is an apocalyptic number.
11001110100012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11001110100012 is an abundant number, since it is smaller than the sum of its proper divisors (17159256126708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001110100012 is a wasteful number, since it uses less digits than its factorization.
11001110100012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3868182262 (or 3868182257 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11001110100012 its reverse (21000101110011), we get a palindrome (32001211210023).
The spelling of 11001110100012 in words is "eleven trillion, one billion, one hundred ten million, one hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •