Base | Representation |
---|---|
bin | 1001100110011000101011… |
… | …11100000101001001110001 |
3 | 2202202002221102022000200111 |
4 | 10303030111330011021301 |
5 | 10231332022334043441 |
6 | 112521505542421321 |
7 | 4306104521111251 |
oct | 463142574051161 |
9 | 82662842260614 |
10 | 21110132331121 |
11 | 67a98363a73a9 |
12 | 244b350731841 |
13 | ba18a52cccc2 |
14 | 52da43293961 |
15 | 2691ca134081 |
hex | 133315f05271 |
21110132331121 has 2 divisors, whose sum is σ = 21110132331122. Its totient is φ = 21110132331120.
The previous prime is 21110132331107. The next prime is 21110132331133. The reversal of 21110132331121 is 12113323101112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15204454705521 + 5905677625600 = 3899289^2 + 2430160^2 .
It is a cyclic number.
It is not a de Polignac number, because 21110132331121 - 219 = 21110131806833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21110132331092 and 21110132331101.
It is not a weakly prime, because it can be changed into another prime (21110132331221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555066165560 + 10555066165561.
It is an arithmetic number, because the mean of its divisors is an integer number (10555066165561).
Almost surely, 221110132331121 is an apocalyptic number.
It is an amenable number.
21110132331121 is a deficient number, since it is larger than the sum of its proper divisors (1).
21110132331121 is an equidigital number, since it uses as much as digits as its factorization.
21110132331121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 21110132331121 its reverse (12113323101112), we get a palindrome (33223455432233).
The spelling of 21110132331121 in words is "twenty-one trillion, one hundred ten billion, one hundred thirty-two million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •