| Base | Representation |
|---|---|
| bin | 1010000001011101000111… |
| … | …0011010101100011010000 |
| 3 | 1110000111211111001211122122 |
| 4 | 2200113101303111203100 |
| 5 | 2421023141404310000 |
| 6 | 35234322532153412 |
| 7 | 2215114424016461 |
| oct | 240272163254320 |
| 9 | 43014744054578 |
| 10 | 11020111010000 |
| 11 | 356966a40a434 |
| 12 | 129b930a68868 |
| 13 | 61c265ac8981 |
| 14 | 2a153a4b6d68 |
| 15 | 1419d2052085 |
| hex | a05d1cd58d0 |
11020111010000 has 200 divisors, whose sum is σ = 26963950105224. Its totient is φ = 4361324800000.
The previous prime is 11020111009933. The next prime is 11020111010011. The reversal of 11020111010000 is 1011102011.
It is a happy number.
It can be written as a sum of positive squares in 20 ways, for example, as 7855284241984 + 3164826768016 = 2802728^2 + 1778996^2 .
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 11020111010000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1895767094 + ... + 1895772906.
Almost surely, 211020111010000 is an apocalyptic number.
11020111010000 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 11020111010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13481975052612).
11020111010000 is an abundant number, since it is smaller than the sum of its proper divisors (15943839095224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020111010000 is a wasteful number, since it uses less digits than its factorization.
11020111010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7819 (or 7798 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11020111010000 its reverse (1011102011), we get a palindrome (11021122112011).
The spelling of 11020111010000 in words is "eleven trillion, twenty billion, one hundred eleven million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •