Base | Representation |
---|---|
bin | 11011100101010011101011… |
… | …101010001000110011101111 |
3 | 120220112012220212101102222111 |
4 | 123211103223222020303233 |
5 | 111400024422030000421 |
6 | 1110001301511024451 |
7 | 34360300626261331 |
oct | 3345235352106357 |
9 | 526465825342874 |
10 | 121311010000111 |
11 | 3572078a634448 |
12 | 11732a7796b127 |
13 | 528c76b540379 |
14 | 21d56ac96d451 |
15 | e0589ee42ee1 |
hex | 6e54eba88cef |
121311010000111 has 2 divisors, whose sum is σ = 121311010000112. Its totient is φ = 121311010000110.
The previous prime is 121311010000021. The next prime is 121311010000163. The reversal of 121311010000111 is 111000010113121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121311010000111 - 225 = 121310976445679 is a prime.
It is a super-2 number, since 2×1213110100001112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121311010000091 and 121311010000100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121311010000211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60655505000055 + 60655505000056.
It is an arithmetic number, because the mean of its divisors is an integer number (60655505000056).
Almost surely, 2121311010000111 is an apocalyptic number.
121311010000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121311010000111 is an equidigital number, since it uses as much as digits as its factorization.
121311010000111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 121311010000111 its reverse (111000010113121), we get a palindrome (232311020113232).
The spelling of 121311010000111 in words is "one hundred twenty-one trillion, three hundred eleven billion, ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •