Base | Representation |
---|---|
bin | 1001001100100000111100… |
… | …00110010110110001111101 |
3 | 2122121010110222000020212101 |
4 | 10212100132012112301331 |
5 | 10122301020004342341 |
6 | 111001255053505101 |
7 | 4154635313424442 |
oct | 446203606266175 |
9 | 78533428006771 |
10 | 20221211012221 |
11 | 64968494a56aa |
12 | 232700a7a2191 |
13 | b38b0cb594cb |
14 | 4dc9d73bd9c9 |
15 | 251000539831 |
hex | 12641e196c7d |
20221211012221 has 2 divisors, whose sum is σ = 20221211012222. Its totient is φ = 20221211012220.
The previous prime is 20221211012209. The next prime is 20221211012243. The reversal of 20221211012221 is 12221011212202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19996449684121 + 224761328100 = 4471739^2 + 474090^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221211012221 - 29 = 20221211011709 is a prime.
It is a super-2 number, since 2×202212110122212 (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 (20221211012521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110605506110 + 10110605506111.
It is an arithmetic number, because the mean of its divisors is an integer number (10110605506111).
Almost surely, 220221211012221 is an apocalyptic number.
It is an amenable number.
20221211012221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221211012221 is an equidigital number, since it uses as much as digits as its factorization.
20221211012221 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 20221211012221 its reverse (12221011212202), we get a palindrome (32442222224423).
The spelling of 20221211012221 in words is "twenty trillion, two hundred twenty-one billion, two hundred eleven million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •