Base | Representation |
---|---|
bin | 1010000110001010110111… |
… | …0101101011010001010100 |
3 | 1110022020220120202121002211 |
4 | 2201202231311223101110 |
5 | 2423340034134201400 |
6 | 35335440325043204 |
7 | 2224012622165632 |
oct | 241425565532124 |
9 | 43266816677084 |
10 | 11101112022100 |
11 | 359aa56370741 |
12 | 12b3577b56504 |
13 | 626aa4433529 |
14 | 2a5422184352 |
15 | 143b73351dba |
hex | a18add6b454 |
11101112022100 has 72 divisors (see below), whose sum is σ = 24420719861048. Its totient is φ = 4379380992000.
The previous prime is 11101112022071. The next prime is 11101112022101. The reversal of 11101112022100 is 122021110111.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 4638880285636 + 6462231736464 = 2153806^2 + 2542092^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101112022101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 207855400 + ... + 207908800.
Almost surely, 211101112022100 is an apocalyptic number.
11101112022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101112022100 is an abundant number, since it is smaller than the sum of its proper divisors (13319607838948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101112022100 is a wasteful number, since it uses less digits than its factorization.
11101112022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81965 (or 81958 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11101112022100 its reverse (122021110111), we get a palindrome (11223133132211).
The spelling of 11101112022100 in words is "eleven trillion, one hundred one billion, one hundred twelve million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •