Base | Representation |
---|---|
bin | 1001100011011110100101… |
… | …10000101011011110111001 |
3 | 2202101120001102112121020022 |
4 | 10301233102300223132321 |
5 | 10223212413040133423 |
6 | 112403543504340225 |
7 | 4265636602021202 |
oct | 461572260533671 |
9 | 82346042477208 |
10 | 21010221021113 |
11 | 6770426038415 |
12 | 2433b08614675 |
13 | b95341ca415c |
14 | 528c85d1c5a9 |
15 | 2667cdab7dc8 |
hex | 131bd2c2b7b9 |
21010221021113 has 2 divisors, whose sum is σ = 21010221021114. Its totient is φ = 21010221021112.
The previous prime is 21010221021079. The next prime is 21010221021121. The reversal of 21010221021113 is 31112012201012.
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., 20558271379129 + 451949641984 = 4534123^2 + 672272^2 .
It is a cyclic number.
It is not a de Polignac number, because 21010221021113 - 212 = 21010221017017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21010221021091 and 21010221021100.
It is not a weakly prime, because it can be changed into another prime (21010221021133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10505110510556 + 10505110510557.
It is an arithmetic number, because the mean of its divisors is an integer number (10505110510557).
Almost surely, 221010221021113 is an apocalyptic number.
It is an amenable number.
21010221021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21010221021113 is an equidigital number, since it uses as much as digits as its factorization.
21010221021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 21010221021113 its reverse (31112012201012), we get a palindrome (52122233222125).
The spelling of 21010221021113 in words is "twenty-one trillion, ten billion, two hundred twenty-one million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •