Base | Representation |
---|---|
bin | 11011100001000100101011… |
… | …010111010001010101110101 |
3 | 120212111101211100021122201112 |
4 | 123201010223113101111311 |
5 | 111330243000340120041 |
6 | 1105215455151204405 |
7 | 34330256636615024 |
oct | 3341045327212565 |
9 | 525441740248645 |
10 | 121020021020021 |
11 | 35619336975842 |
12 | 116a65a8216705 |
13 | 526b1a654c906 |
14 | 21c55864b08bb |
15 | ded01d8dadeb |
hex | 6e112b5d1575 |
121020021020021 has 2 divisors, whose sum is σ = 121020021020022. Its totient is φ = 121020021020020.
The previous prime is 121020021020009. The next prime is 121020021020029. The reversal of 121020021020021 is 120020120020121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97099069300996 + 23920951719025 = 9853886^2 + 4890905^2 .
It is a cyclic number.
It is not a de Polignac number, because 121020021020021 - 210 = 121020021018997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121020021019978 and 121020021020005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121020021020029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510010510010 + 60510010510011.
It is an arithmetic number, because the mean of its divisors is an integer number (60510010510011).
Almost surely, 2121020021020021 is an apocalyptic number.
It is an amenable number.
121020021020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
121020021020021 is an equidigital number, since it uses as much as digits as its factorization.
121020021020021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121020021020021 its reverse (120020120020121), we get a palindrome (241040141040142).
The spelling of 121020021020021 in words is "one hundred twenty-one trillion, twenty billion, twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •