Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1101111001110101000000 |
3 | 1102221200202122101021101012 |
4 | 2200011210231321311000 |
5 | 2420220223324000000 |
6 | 35221500325500052 |
7 | 2213542352423006 |
oct | 240054455716500 |
9 | 42850678337335 |
10 | 11001101000000 |
11 | 35615a4797571 |
12 | 1298106571628 |
13 | 61a526564c47 |
14 | 2a0655894a76 |
15 | 14126d18b735 |
hex | a0164b79d40 |
11001101000000 has 196 divisors, whose sum is σ = 27408312919104. Its totient is φ = 4380964800000.
The previous prime is 11001100999969. The next prime is 11001101000023. The reversal of 11001101000000 is 10110011.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 226975769 + ... + 227024231.
Almost surely, 211001101000000 is an apocalyptic number.
11001101000000 is a gapful number since it is divisible by the number (10) 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 11001101000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13704156459552).
11001101000000 is an abundant number, since it is smaller than the sum of its proper divisors (16407211919104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001101000000 is an frugal number, since it uses more digits than its factorization.
11001101000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48732 (or 48697 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 11001101000000 its reverse (10110011), we get a palindrome (11001111110011).
The spelling of 11001101000000 in words is "eleven trillion, one billion, one hundred one million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •