Base | Representation |
---|---|
bin | 111000011001011011… |
… | …0000000010001111011 |
3 | 102120121111210020122211 |
4 | 1300302312000101323 |
5 | 3441014144231021 |
6 | 131345500355551 |
7 | 11515161611215 |
oct | 1606266002173 |
9 | 376544706584 |
10 | 121112102011 |
11 | 473aa69589a |
12 | 1b580245bb7 |
13 | b5617145b4 |
14 | 5c0cd155b5 |
15 | 323c92c3e1 |
hex | 1c32d8047b |
121112102011 has 2 divisors, whose sum is σ = 121112102012. Its totient is φ = 121112102010.
The previous prime is 121112102009. The next prime is 121112102017. The reversal of 121112102011 is 110201211121.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (110201211121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121112102011 - 21 = 121112102009 is a prime.
Together with 121112102009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 121112101982 and 121112102000.
It is not a weakly prime, because it can be changed into another prime (121112102017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60556051005 + 60556051006.
It is an arithmetic number, because the mean of its divisors is an integer number (60556051006).
Almost surely, 2121112102011 is an apocalyptic number.
121112102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
121112102011 is an equidigital number, since it uses as much as digits as its factorization.
121112102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121112102011 its reverse (110201211121), we get a palindrome (231313313132).
The spelling of 121112102011 in words is "one hundred twenty-one billion, one hundred twelve million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •