| Base | Representation |
|---|---|
| bin | 1010000000111011111101… |
| … | …0000101101110110010000 |
| 3 | 1102222122212011021012002222 |
| 4 | 2200032333100231312100 |
| 5 | 2420401424230310000 |
| 6 | 35230251405000212 |
| 7 | 2214351022534244 |
| oct | 240167720556620 |
| 9 | 42878764235088 |
| 10 | 11011210010000 |
| 11 | 3565911a97392 |
| 12 | 129a067b53068 |
| 13 | 61b4779cbc75 |
| 14 | 2a0d342b2424 |
| 15 | 1416608cda85 |
| hex | a03bf42dd90 |
11011210010000 has 100 divisors (see below), whose sum is σ = 26692213491900. Its totient is φ = 4399036416000.
The previous prime is 11011210009973. The next prime is 11011210010023. The reversal of 11011210010000 is 1001211011.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 8131645372816 + 2879564637184 = 2851604^2 + 1696928^2 .
It is a tau number, because it is divible by the number of its divisors (100).
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 11011210010000.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 7409456 + ... + 8770544.
It is an arithmetic number, because the mean of its divisors is an integer number (266922134919).
Almost surely, 211011210010000 is an apocalyptic number.
11011210010000 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 11011210010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13346106745950).
11011210010000 is an abundant number, since it is smaller than the sum of its proper divisors (15681003481900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011210010000 is an equidigital number, since it uses as much as digits as its factorization.
11011210010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1361926 (or 1361905 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 11011210010000 its reverse (1001211011), we get a palindrome (11012211221011).
The spelling of 11011210010000 in words is "eleven trillion, eleven billion, two hundred ten million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •