Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …000011100000111101111111 |
3 | 120212211010011202122021012111 |
4 | 123202121212003200331333 |
5 | 111333241214200310421 |
6 | 1105325414525314451 |
7 | 34336665303343333 |
oct | 3342314603407577 |
9 | 525733152567174 |
10 | 121111200010111 |
11 | 35653a76052603 |
12 | 117001b3a05a27 |
13 | 52769776bb35c |
14 | 21c9b55bcd7c3 |
15 | e005a8502ee1 |
hex | 6e26660e0f7f |
121111200010111 has 2 divisors, whose sum is σ = 121111200010112. Its totient is φ = 121111200010110.
The previous prime is 121111200010037. The next prime is 121111200010123. The reversal of 121111200010111 is 111010002111121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121111200010111 - 27 = 121111200009983 is a prime.
It is a super-2 number, since 2×1211112000101112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121111200010091 and 121111200010100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121111200017111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555600005055 + 60555600005056.
It is an arithmetic number, because the mean of its divisors is an integer number (60555600005056).
Almost surely, 2121111200010111 is an apocalyptic number.
121111200010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111200010111 is an equidigital number, since it uses as much as digits as its factorization.
121111200010111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 121111200010111 its reverse (111010002111121), we get a palindrome (232121202121232).
The spelling of 121111200010111 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •