Base | Representation |
---|---|
bin | 11011100010101100010000… |
… | …000011100100111001110011 |
3 | 120212220000212211101220200121 |
4 | 123202230100003210321303 |
5 | 111334103230344202011 |
6 | 1105342530401031111 |
7 | 34341304564545622 |
oct | 3342542003447163 |
9 | 525800784356617 |
10 | 121131232022131 |
11 | 35661515656741 |
12 | 11704064625497 |
13 | 527881a8c39c6 |
14 | 21caad64496b9 |
15 | e00d7be93e71 |
hex | 6e2b100e4e73 |
121131232022131 has 2 divisors, whose sum is σ = 121131232022132. Its totient is φ = 121131232022130.
The previous prime is 121131232022093. The next prime is 121131232022137. The reversal of 121131232022131 is 131220232131121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121131232022131 - 215 = 121131231989363 is a prime.
It is a super-2 number, since 2×1211312320221312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121131232022096 and 121131232022105.
It is not a weakly prime, because it can be changed into another prime (121131232022137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60565616011065 + 60565616011066.
It is an arithmetic number, because the mean of its divisors is an integer number (60565616011066).
Almost surely, 2121131232022131 is an apocalyptic number.
121131232022131 is a deficient number, since it is larger than the sum of its proper divisors (1).
121131232022131 is an equidigital number, since it uses as much as digits as its factorization.
121131232022131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 121131232022131 its reverse (131220232131121), we get a palindrome (252351464153252).
The spelling of 121131232022131 in words is "one hundred twenty-one trillion, one hundred thirty-one billion, two hundred thirty-two million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •