| Base | Representation |
|---|---|
| bin | 1010000000011010011000… |
| … | …1110101011001110110000 |
| 3 | 1102221210121020112211211222 |
| 4 | 2200012212032223032300 |
| 5 | 2420230001212010000 |
| 6 | 35222201351324212 |
| 7 | 2213611526621231 |
| oct | 240064616531660 |
| 9 | 42853536484758 |
| 10 | 11002200110000 |
| 11 | 3562009154140 |
| 12 | 1298372680668 |
| 13 | 61a6701937a8 |
| 14 | 2a071b841088 |
| 15 | 1412d48e8a85 |
| hex | a01a63ab3b0 |
11002200110000 has 450 divisors, whose sum is σ = 29679157295172. Its totient is φ = 3917191680000.
The previous prime is 11002200109997. The next prime is 11002200110009. The reversal of 11002200110000 is 1100220011.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a zygodrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 11002200110000.
It is not an unprimeable number, because it can be changed into a prime (11002200110009) by changing a digit.
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 89 ways as a sum of consecutive naturals, for example, 80308029932 + ... + 80308030068.
Almost surely, 211002200110000 is an apocalyptic number.
11002200110000 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 11002200110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14839578647586).
11002200110000 is an abundant number, since it is smaller than the sum of its proper divisors (18676957185172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002200110000 is an frugal number, since it uses more digits than its factorization.
11002200110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459 (or 228 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 11002200110000 its reverse (1100220011), we get a palindrome (11003300330011).
11002200110000 divided by its reverse (1100220011) gives a 4-th power (10000 = 104).
It can be divided in two parts, 11002 and 200110000, that added together give a palindrome (200121002).
The spelling of 11002200110000 in words is "eleven trillion, two billion, two hundred million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •