Base | Representation |
---|---|
bin | 1010000110001110100011… |
… | …0110001011110001111000 |
3 | 1110022100110120121020120101 |
4 | 2201203220312023301320 |
5 | 2423344101103323000 |
6 | 35340122452005144 |
7 | 2224046303022640 |
oct | 241435066136170 |
9 | 43270416536511 |
10 | 11102102011000 |
11 | 35a0414176a90 |
12 | 12b37b36007b4 |
13 | 626c01576a90 |
14 | 2a54b7847520 |
15 | 143bd0206e6a |
hex | a18e8d8bc78 |
11102102011000 has 256 divisors, whose sum is σ = 34880789099520. Its totient is φ = 3194210880000.
The previous prime is 11102102010991. The next prime is 11102102011067. The reversal of 11102102011000 is 11020120111.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4544506 + ... + 6546505.
It is an arithmetic number, because the mean of its divisors is an integer number (136253082420).
Almost surely, 211102102011000 is an apocalyptic number.
11102102011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102102011000 is an abundant number, since it is smaller than the sum of its proper divisors (23778687088520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102102011000 is a wasteful number, since it uses less digits than its factorization.
11102102011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11091063 (or 11091049 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11102102011000 its reverse (11020120111), we get a palindrome (11113122131111).
The spelling of 11102102011000 in words is "eleven trillion, one hundred two billion, one hundred two million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •