Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …0101110010001000010101 |
3 | 1110022021012012000102201212 |
4 | 2201202310111302020111 |
5 | 2423340300100231401 |
6 | 35335455223031205 |
7 | 2224015415306264 |
oct | 241426425621025 |
9 | 43267165012655 |
10 | 11101221102101 |
11 | 35a00019a40a9 |
12 | 12b35a859b505 |
13 | 626ac0c05c00 |
14 | 2a543285a5db |
15 | 143b7cbebdbb |
hex | a18b4572215 |
11101221102101 has 12 divisors (see below), whose sum is σ = 12300403519008. Its totient is φ = 10008972149904.
The previous prime is 11101221102073. The next prime is 11101221102107. The reversal of 11101221102101 is 10120112210111.
It is not a de Polignac number, because 11101221102101 - 210 = 11101221101077 is a prime.
It is a super-2 number, since 2×111012211021012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101221102107) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 763803185 + ... + 763817718.
It is an arithmetic number, because the mean of its divisors is an integer number (1025033626584).
Almost surely, 211101221102101 is an apocalyptic number.
It is an amenable number.
11101221102101 is a deficient number, since it is larger than the sum of its proper divisors (1199182416907).
11101221102101 is a wasteful number, since it uses less digits than its factorization.
11101221102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1527620972 (or 1527620959 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11101221102101 its reverse (10120112210111), we get a palindrome (21221333312212).
The spelling of 11101221102101 in words is "eleven trillion, one hundred one billion, two hundred twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •