Base | Representation |
---|---|
bin | 11011100001000100101010… |
… | …110101101101001010110111 |
3 | 120212111101210201201121212222 |
4 | 123201010222311231022313 |
5 | 111330242441112033421 |
6 | 1105215454234432555 |
7 | 34330256502050153 |
oct | 3341045265551267 |
9 | 525441721647788 |
10 | 121020012221111 |
11 | 35619331a06013 |
12 | 116a65a529275b |
13 | 526b1a478b963 |
14 | 21c5585260063 |
15 | ded01cc4dcab |
hex | 6e112ad6d2b7 |
121020012221111 has 2 divisors, whose sum is σ = 121020012221112. Its totient is φ = 121020012221110.
The previous prime is 121020012221047. The next prime is 121020012221153. The reversal of 121020012221111 is 111122210020121.
It is a strong prime.
It is an emirp because it is prime and its reverse (111122210020121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121020012221111 - 26 = 121020012221047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121020012221111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121020012251111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510006110555 + 60510006110556.
It is an arithmetic number, because the mean of its divisors is an integer number (60510006110556).
Almost surely, 2121020012221111 is an apocalyptic number.
121020012221111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121020012221111 is an equidigital number, since it uses as much as digits as its factorization.
121020012221111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121020012221111 its reverse (111122210020121), we get a palindrome (232142222241232).
The spelling of 121020012221111 in words is "one hundred twenty-one trillion, twenty billion, twelve million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •