Base | Representation |
---|---|
bin | 1010000110110000001001… |
… | …1011101100101101011001 |
3 | 1110100012202010211000221020 |
4 | 2201230002123230231121 |
5 | 2424021034012211301 |
6 | 35344213440433053 |
7 | 2224515640656225 |
oct | 241540233545531 |
9 | 43305663730836 |
10 | 11111121210201 |
11 | 35a4222290921 |
12 | 12b54b0018789 |
13 | 627a0acb9b3c |
14 | 2a5ad1619785 |
15 | 14405be27436 |
hex | a1b026ecb59 |
11111121210201 has 16 divisors (see below), whose sum is σ = 15036418836288. Its totient is φ = 7296625828800.
The previous prime is 11111121210193. The next prime is 11111121210209. The reversal of 11111121210201 is 10201212111111.
It is an interprime number because it is at equal distance from previous prime (11111121210193) and next prime (11111121210209).
It is not a de Polignac number, because 11111121210201 - 23 = 11111121210193 is a prime.
It is a super-3 number, since 3×111111212102013 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (11111121210209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5645911 + ... + 7355171.
It is an arithmetic number, because the mean of its divisors is an integer number (939776177268).
Almost surely, 211111121210201 is an apocalyptic number.
It is an amenable number.
11111121210201 is a deficient number, since it is larger than the sum of its proper divisors (3925297626087).
11111121210201 is a wasteful number, since it uses less digits than its factorization.
11111121210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1741672.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11111121210201 its reverse (10201212111111), we get a palindrome (21312333321312).
The spelling of 11111121210201 in words is "eleven trillion, one hundred eleven billion, one hundred twenty-one million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •