Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1111011011110100010000 |
3 | 1110022100111220201211000222 |
4 | 2201203221333123310100 |
5 | 2423344121012310300 |
6 | 35340124415332212 |
7 | 2224046625160013 |
oct | 241435177336420 |
9 | 43270456654028 |
10 | 11102121213200 |
11 | 35a0423aa1976 |
12 | 12b37b9b21068 |
13 | 626c0553b024 |
14 | 2a54ba20537a |
15 | 143bd1c4b785 |
hex | a18e9fdbd10 |
11102121213200 has 30 divisors (see below), whose sum is σ = 26672846215674. Its totient is φ = 4440848485120.
The previous prime is 11102121213149. The next prime is 11102121213229. The reversal of 11102121213200 is 231212120111.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 2035084846096 + 9067036367104 = 1426564^2 + 3011152^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 13877651117 + ... + 13877651916.
Almost surely, 211102121213200 is an apocalyptic number.
11102121213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102121213200 is an abundant number, since it is smaller than the sum of its proper divisors (15570725002474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102121213200 is a wasteful number, since it uses less digits than its factorization.
11102121213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27755303051 (or 27755303040 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11102121213200 its reverse (231212120111), we get a palindrome (11333333333311).
The spelling of 11102121213200 in words is "eleven trillion, one hundred two billion, one hundred twenty-one million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •