Base | Representation |
---|---|
bin | 1010000001100001001101… |
… | …1011101101000100010001 |
3 | 1110000121200012222120102122 |
4 | 2200120103123231010101 |
5 | 2421032420300023441 |
6 | 35235024104424025 |
7 | 2215153624150022 |
oct | 240302333550421 |
9 | 43017605876378 |
10 | 11021212111121 |
11 | 356a084a06a63 |
12 | 129bb99778015 |
13 | 61c3acc738b4 |
14 | 2a1602820c49 |
15 | 141a48a5434b |
hex | a06136ed111 |
11021212111121 has 2 divisors, whose sum is σ = 11021212111122. Its totient is φ = 11021212111120.
The previous prime is 11021212111067. The next prime is 11021212111127. The reversal of 11021212111121 is 12111121212011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7682259912721 + 3338952198400 = 2771689^2 + 1827280^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021212111121 - 242 = 6623165600017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11021212111121.
It is not a weakly prime, because it can be changed into another prime (11021212111127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510606055560 + 5510606055561.
It is an arithmetic number, because the mean of its divisors is an integer number (5510606055561).
Almost surely, 211021212111121 is an apocalyptic number.
It is an amenable number.
11021212111121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021212111121 is an equidigital number, since it uses as much as digits as its factorization.
11021212111121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11021212111121 its reverse (12111121212011), we get a palindrome (23132333323132).
The spelling of 11021212111121 in words is "eleven trillion, twenty-one billion, two hundred twelve million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •