Base | Representation |
---|---|
bin | 11011100001010001000100… |
… | …101100111001010101001011 |
3 | 120212112200011221101202202121 |
4 | 123201101010230321111023 |
5 | 111331002230220134011 |
6 | 1105225540014512111 |
7 | 34331240526015004 |
oct | 3341210454712513 |
9 | 525480157352677 |
10 | 121033331021131 |
11 | 35623a47035661 |
12 | 116a90a1805637 |
13 | 526c517c11609 |
14 | 21c608a0941ab |
15 | ded54c174e71 |
hex | 6e1444b3954b |
121033331021131 has 2 divisors, whose sum is σ = 121033331021132. Its totient is φ = 121033331021130.
The previous prime is 121033331021047. The next prime is 121033331021147. The reversal of 121033331021131 is 131120133330121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121033331021131 - 27 = 121033331021003 is a prime.
It is a super-2 number, since 2×1210333310211312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121033331021096 and 121033331021105.
It is not a weakly prime, because it can be changed into another prime (121033332021131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60516665510565 + 60516665510566.
It is an arithmetic number, because the mean of its divisors is an integer number (60516665510566).
Almost surely, 2121033331021131 is an apocalyptic number.
121033331021131 is a deficient number, since it is larger than the sum of its proper divisors (1).
121033331021131 is an equidigital number, since it uses as much as digits as its factorization.
121033331021131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 121033331021131 its reverse (131120133330121), we get a palindrome (252153464351252).
The spelling of 121033331021131 in words is "one hundred twenty-one trillion, thirty-three billion, three hundred thirty-one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •