| Base | Representation |
|---|---|
| bin | 1010000110001010011100… |
| … | …1110001010100000110100 |
| 3 | 1110022020121211212010210200 |
| 4 | 2201202213032022200310 |
| 5 | 2423334322224013022 |
| 6 | 35335421321320500 |
| 7 | 2224010103422166 |
| oct | 241424716124064 |
| 9 | 43266554763720 |
| 10 | 11101001001012 |
| 11 | 359a9a973197a |
| 12 | 12b3546936130 |
| 13 | 626a87431490 |
| 14 | 2a5411524936 |
| 15 | 143b68721bac |
| hex | a18a738a834 |
11101001001012 has 144 divisors (see below), whose sum is σ = 30400291958400. Its totient is φ = 3395253613824.
The previous prime is 11101001001007. The next prime is 11101001001031. The reversal of 11101001001012 is 21010010010111.
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 = 11101001000985 and 11101001001003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 509981353 + ... + 510003119.
It is an arithmetic number, because the mean of its divisors is an integer number (211113138600).
Almost surely, 211101001001012 is an apocalyptic number.
11101001001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11101001001012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15200145979200).
11101001001012 is an abundant number, since it is smaller than the sum of its proper divisors (19299290957388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101001001012 is a wasteful number, since it uses less digits than its factorization.
11101001001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28262 (or 28257 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11101001001012 its reverse (21010010010111), we get a palindrome (32111011011123).
Subtracting 11101001001012 from its reverse (21010010010111), we obtain a palindrome (9909009009099).
It can be divided in two parts, 1110100 and 1001012, that added together give a palindrome (2111112).
The spelling of 11101001001012 in words is "eleven trillion, one hundred one billion, one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •