Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …101110001111010110010011 |
3 | 120212211010012112201021202001 |
4 | 123202121212232033112103 |
5 | 111333241230032211011 |
6 | 1105325420005334431 |
7 | 34336665500501422 |
oct | 3342314656172623 |
9 | 525733175637661 |
10 | 121111211210131 |
11 | 35653a8140231a |
12 | 117001b7707417 |
13 | 5276979b1019c |
14 | 21c9b574a72b9 |
15 | e005a94b67c1 |
hex | 6e2666b8f593 |
121111211210131 has 2 divisors, whose sum is σ = 121111211210132. Its totient is φ = 121111211210130.
The previous prime is 121111211210107. The next prime is 121111211210153. The reversal of 121111211210131 is 131012112111121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121111211210131 is a prime.
It is a super-2 number, since 2×1211112112101312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121111211210099 and 121111211210108.
It is not a weakly prime, because it can be changed into another prime (121111211810131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555605605065 + 60555605605066.
It is an arithmetic number, because the mean of its divisors is an integer number (60555605605066).
Almost surely, 2121111211210131 is an apocalyptic number.
121111211210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111211210131 is an equidigital number, since it uses as much as digits as its factorization.
121111211210131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 19.
Adding to 121111211210131 its reverse (131012112111121), we get a palindrome (252123323321252).
The spelling of 121111211210131 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred eleven million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •