Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0111010010001010001000 |
3 | 1102222122212212021211200211 |
4 | 2200032333313102022020 |
5 | 2420401434322321300 |
6 | 35230252405410504 |
7 | 2214351204503116 |
oct | 240167767221210 |
9 | 42878785254624 |
10 | 11011220120200 |
11 | 3565917772323 |
12 | 129a06b409a34 |
13 | 61b479b2ba31 |
14 | 2a0d35784ab6 |
15 | 1416617294ba |
hex | a03bfdd2288 |
11011220120200 has 48 divisors (see below), whose sum is σ = 27107033068980. Its totient is φ = 4145400514560.
The previous prime is 11011220120179. The next prime is 11011220120221. The reversal of 11011220120200 is 202102211011.
It is an interprime number because it is at equal distance from previous prime (11011220120179) and next prime (11011220120221).
It can be written as a sum of positive squares in 6 ways, for example, as 2979290027844 + 8031930092356 = 1726062^2 + 2834066^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1619293677 + ... + 1619300476.
Almost surely, 211011220120200 is an apocalyptic number.
11011220120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011220120200 is an abundant number, since it is smaller than the sum of its proper divisors (16095812948780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011220120200 is a wasteful number, since it uses less digits than its factorization.
11011220120200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3238594186 (or 3238594177 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11011220120200 its reverse (202102211011), we get a palindrome (11213322331211).
The spelling of 11011220120200 in words is "eleven trillion, eleven billion, two hundred twenty million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •