Base | Representation |
---|---|
bin | 1001100110011010101100… |
… | …01011011110110001011001 |
3 | 2202202012201112022212102021 |
4 | 10303031112023132301121 |
5 | 10231341224242010131 |
6 | 112522204523134441 |
7 | 4306143316064662 |
oct | 463152613366131 |
9 | 82665645285367 |
10 | 21111210110041 |
11 | 67aa239814687 |
12 | 244b5b1674421 |
13 | ba1a176a05cc |
14 | 52db0648a369 |
15 | 26923ea7ae11 |
hex | 1333562dec59 |
21111210110041 has 2 divisors, whose sum is σ = 21111210110042. Its totient is φ = 21111210110040.
The previous prime is 21111210109961. The next prime is 21111210110047. The reversal of 21111210110041 is 14001101211112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16491891562441 + 4619318547600 = 4061021^2 + 2149260^2 .
It is a cyclic number.
It is not a de Polignac number, because 21111210110041 - 29 = 21111210109529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21111210109997 and 21111210110024.
It is not a weakly prime, because it can be changed into another prime (21111210110047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555605055020 + 10555605055021.
It is an arithmetic number, because the mean of its divisors is an integer number (10555605055021).
Almost surely, 221111210110041 is an apocalyptic number.
It is an amenable number.
21111210110041 is a deficient number, since it is larger than the sum of its proper divisors (1).
21111210110041 is an equidigital number, since it uses as much as digits as its factorization.
21111210110041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 21111210110041 its reverse (14001101211112), we get a palindrome (35112311321153).
The spelling of 21111210110041 in words is "twenty-one trillion, one hundred eleven billion, two hundred ten million, one hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •