Base | Representation |
---|---|
bin | 1001100110101110110011… |
… | …11101101100001110001101 |
3 | 2202210020121021011001111201 |
4 | 10303113121331230032031 |
5 | 10232030334310202341 |
6 | 112531152400145501 |
7 | 4310005060242604 |
oct | 463273175541615 |
9 | 82706537131451 |
10 | 21122011022221 |
11 | 680388163288a |
12 | 2451706908291 |
13 | ba2a4929cbc5 |
14 | 53044cb34a3b |
15 | 269672de1331 |
hex | 1335d9f6c38d |
21122011022221 has 2 divisors, whose sum is σ = 21122011022222. Its totient is φ = 21122011022220.
The previous prime is 21122011022207. The next prime is 21122011022243. The reversal of 21122011022221 is 12222011022112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18905634459721 + 2216376562500 = 4348061^2 + 1488750^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21122011022221 is a prime.
It is a super-2 number, since 2×211220110222212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21122011022201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561005511110 + 10561005511111.
It is an arithmetic number, because the mean of its divisors is an integer number (10561005511111).
Almost surely, 221122011022221 is an apocalyptic number.
It is an amenable number.
21122011022221 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122011022221 is an equidigital number, since it uses as much as digits as its factorization.
21122011022221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21122011022221 its reverse (12222011022112), we get a palindrome (33344022044333).
The spelling of 21122011022221 in words is "twenty-one trillion, one hundred twenty-two billion, eleven million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •