Base | Representation |
---|---|
bin | 1010000000010101111111… |
… | …1001110000011100010000 |
3 | 1102221200120000101021200210 |
4 | 2200011133321300130100 |
5 | 2420220042134034300 |
6 | 35221444322244120 |
7 | 2213540352004212 |
oct | 240053771603420 |
9 | 42850500337623 |
10 | 11001020221200 |
11 | 3561563134229 |
12 | 12980a34b6640 |
13 | 61a5128c1239 |
14 | 2a0648c685b2 |
15 | 141266032050 |
hex | a015fe70710 |
11001020221200 has 120 divisors (see below), whose sum is σ = 35603233448608. Its totient is φ = 2903362007040.
The previous prime is 11001020221183. The next prime is 11001020221223. The reversal of 11001020221200 is 212202010011.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
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 23 ways as a sum of consecutive naturals, for example, 47138842 + ... + 47371641.
Almost surely, 211001020221200 is an apocalyptic number.
11001020221200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001020221200 is an abundant number, since it is smaller than the sum of its proper divisors (24602213227408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001020221200 is a wasteful number, since it uses less digits than its factorization.
11001020221200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94510601 (or 94510590 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11001020221200 its reverse (212202010011), we get a palindrome (11213222231211).
The spelling of 11001020221200 in words is "eleven trillion, one billion, twenty million, two hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •