Base | Representation |
---|---|
bin | 1010000111010001100110… |
… | …0111001001001111010000 |
3 | 1110101001220220000220002202 |
4 | 2201310121213021033100 |
5 | 2424142431101134300 |
6 | 35352300423502332 |
7 | 2225254305416612 |
oct | 241643147111720 |
9 | 43331826026082 |
10 | 11120100021200 |
11 | 35a800a61a485 |
12 | 12b7196bb79a8 |
13 | 62880c25b761 |
14 | 2a6303cb6db2 |
15 | 1443d531aad5 |
hex | a1d199c93d0 |
11120100021200 has 30 divisors (see below), whose sum is σ = 26716040301894. Its totient is φ = 4448040008320.
The previous prime is 11120100021193. The next prime is 11120100021209. The reversal of 11120100021200 is 212000102111.
It can be written as a sum of positive squares in 3 ways, for example, as 537154136464 + 10582945884736 = 732908^2 + 3253144^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120100021209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13900124627 + ... + 13900125426.
Almost surely, 211120100021200 is an apocalyptic number.
11120100021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11120100021200 is an abundant number, since it is smaller than the sum of its proper divisors (15595940280694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120100021200 is a wasteful number, since it uses less digits than its factorization.
11120100021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27800250071 (or 27800250060 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11120100021200 its reverse (212000102111), we get a palindrome (11332100123311).
The spelling of 11120100021200 in words is "eleven trillion, one hundred twenty billion, one hundred million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •