| Base | Representation |
|---|---|
| bin | 1010000000111011001011… |
| … | …0011011100011101011100 |
| 3 | 1102222122022120222220000200 |
| 4 | 2200032302303130131130 |
| 5 | 2420401012224310022 |
| 6 | 35230214541223500 |
| 7 | 2214342604213653 |
| oct | 240166263343534 |
| 9 | 42878276886020 |
| 10 | 11011001010012 |
| 11 | 3565815017623 |
| 12 | 129a009b61b90 |
| 13 | 61b443613333 |
| 14 | 2a0d1462a19a |
| 15 | 14164c397bac |
| hex | a03b2cdc75c |
11011001010012 has 72 divisors (see below), whose sum is σ = 29298930460800. Its totient is φ = 3477080724768.
The previous prime is 11011001010011. The next prime is 11011001010013. The reversal of 11011001010012 is 21001010011011.
11011001010012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11011001010011) and next prime (11011001010013).
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 = 11011001009976 and 11011001010003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011001010011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35810953 + ... + 36117119.
Almost surely, 211011001010012 is an apocalyptic number.
11011001010012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11011001010012 is an abundant number, since it is smaller than the sum of its proper divisors (18287929450788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011001010012 is a wasteful number, since it uses less digits than its factorization.
11011001010012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358775 (or 358770 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011001010012 its reverse (21001010011011), we get a palindrome (32012011021023).
Subtracting 11011001010012 from its reverse (21001010011011), we obtain a palindrome (9990009000999).
It can be divided in two parts, 1101100 and 1010012, that added together give a palindrome (2111112).
The spelling of 11011001010012 in words is "eleven trillion, eleven billion, one million, ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •