Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …1010110000110101100001 |
3 | 1110000121102012002210221020 |
4 | 2200120031122300311201 |
5 | 2421032213431413441 |
6 | 35235010101520053 |
7 | 2215151260344540 |
oct | 240301532606541 |
9 | 43017365083836 |
10 | 11021111201121 |
11 | 356a032a5386a |
12 | 129bb6ba13029 |
13 | 61c3950a1b38 |
14 | 2a15d3274157 |
15 | 141a3ec6ee66 |
hex | a060d6b0d61 |
11021111201121 has 32 divisors (see below), whose sum is σ = 16924980898560. Its totient is φ = 6248875555584.
The previous prime is 11021111201119. The next prime is 11021111201123. The reversal of 11021111201121 is 12110211112011.
It is an interprime number because it is at equal distance from previous prime (11021111201119) and next prime (11021111201123).
It is not a de Polignac number, because 11021111201121 - 21 = 11021111201119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11021111201121.
It is not an unprimeable number, because it can be changed into a prime (11021111201123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2501830 + ... + 5319903.
It is an arithmetic number, because the mean of its divisors is an integer number (528905653080).
Almost surely, 211021111201121 is an apocalyptic number.
It is an amenable number.
11021111201121 is a deficient number, since it is larger than the sum of its proper divisors (5903869697439).
11021111201121 is a wasteful number, since it uses less digits than its factorization.
11021111201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7822265.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11021111201121 its reverse (12110211112011), we get a palindrome (23131322313132).
The spelling of 11021111201121 in words is "eleven trillion, twenty-one billion, one hundred eleven million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •