Base | Representation |
---|---|
bin | 1001100011110001001100… |
… | …01001100111000011110001 |
3 | 2202102111211120120022101111 |
4 | 10301320212021213003301 |
5 | 10223343342230000423 |
6 | 112412315015033321 |
7 | 4266442253652022 |
oct | 461704611470361 |
9 | 82374746508344 |
10 | 21020210000113 |
11 | 6774691605165 |
12 | 2435a3596b841 |
13 | b9627460310c |
14 | 529552812c49 |
15 | 266bb59ea60d |
hex | 131e262670f1 |
21020210000113 has 2 divisors, whose sum is σ = 21020210000114. Its totient is φ = 21020210000112.
The previous prime is 21020210000059. The next prime is 21020210000123. The reversal of 21020210000113 is 31100001202012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13526889563664 + 7493320436449 = 3677892^2 + 2737393^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020210000113 - 221 = 21020207902961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21020210000093 and 21020210000102.
It is not a weakly prime, because it can be changed into another prime (21020210000123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510105000056 + 10510105000057.
It is an arithmetic number, because the mean of its divisors is an integer number (10510105000057).
Almost surely, 221020210000113 is an apocalyptic number.
It is an amenable number.
21020210000113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020210000113 is an equidigital number, since it uses as much as digits as its factorization.
21020210000113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 21020210000113 its reverse (31100001202012), we get a palindrome (52120211202125).
The spelling of 21020210000113 in words is "twenty-one trillion, twenty billion, two hundred ten million, one hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •