Base | Representation |
---|---|
bin | 1001100011100001111001… |
… | …10011000011111000001101 |
3 | 2202101201122102001121221112 |
4 | 10301300330303003320031 |
5 | 10223230034001431341 |
6 | 112404440214541405 |
7 | 4266031643241524 |
oct | 461607463037015 |
9 | 82351572047845 |
10 | 21012000030221 |
11 | 6771159265282 |
12 | 2434324367865 |
13 | b95566724a75 |
14 | 528db42cd4bb |
15 | 266884d76aeb |
hex | 131c3ccc3e0d |
21012000030221 has 2 divisors, whose sum is σ = 21012000030222. Its totient is φ = 21012000030220.
The previous prime is 21012000030167. The next prime is 21012000030251. The reversal of 21012000030221 is 12203000021012.
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., 20742650448100 + 269349582121 = 4554410^2 + 518989^2 .
It is a cyclic number.
It is not a de Polignac number, because 21012000030221 - 218 = 21011999768077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21012000030196 and 21012000030205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21012000030251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10506000015110 + 10506000015111.
It is an arithmetic number, because the mean of its divisors is an integer number (10506000015111).
Almost surely, 221012000030221 is an apocalyptic number.
It is an amenable number.
21012000030221 is a deficient number, since it is larger than the sum of its proper divisors (1).
21012000030221 is an equidigital number, since it uses as much as digits as its factorization.
21012000030221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 21012000030221 its reverse (12203000021012), we get a palindrome (33215000051233).
The spelling of 21012000030221 in words is "twenty-one trillion, twelve billion, thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •