Base | Representation |
---|---|
bin | 1010001011111011010010… |
… | …1011110011001000110000 |
3 | 1110122201012000212101020010 |
4 | 2202332310223303020300 |
5 | 2432000110321334300 |
6 | 35453114124014520 |
7 | 2234113500516546 |
oct | 242766453631060 |
9 | 43581160771203 |
10 | 11200011121200 |
11 | 3628997326690 |
12 | 130a779091440 |
13 | 633205b38205 |
14 | 2aa124d0dd96 |
15 | 146510ac8a50 |
hex | a2fb4af3230 |
11200011121200 has 240 divisors, whose sum is σ = 41441239840896. Its totient is φ = 2555439206400.
The previous prime is 11200011121193. The next prime is 11200011121213. The reversal of 11200011121200 is 212111000211.
11200011121200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24731062 + ... + 25179861.
Almost surely, 211200011121200 is an apocalyptic number.
11200011121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11200011121200 is an abundant number, since it is smaller than the sum of its proper divisors (30241228719696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200011121200 is a wasteful number, since it uses less digits than its factorization.
11200011121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49910972 (or 49910961 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11200011121200 its reverse (212111000211), we get a palindrome (11412122121411).
The spelling of 11200011121200 in words is "eleven trillion, two hundred billion, eleven million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •