Base | Representation |
---|---|
bin | 1010000000111001101110… |
… | …00011101010000010100101 |
3 | 2212222012121202102111000201 |
4 | 11000130313003222002211 |
5 | 10341243430041011401 |
6 | 114500224223310501 |
7 | 4431660246230134 |
oct | 500346703520245 |
9 | 85865552374021 |
10 | 22021221032101 |
11 | 70201691a9385 |
12 | 2577a3a44b431 |
13 | c3979119c325 |
14 | 561b9323991b |
15 | 282c50dc1b01 |
hex | 1407370ea0a5 |
22021221032101 has 2 divisors, whose sum is σ = 22021221032102. Its totient is φ = 22021221032100.
The previous prime is 22021221032051. The next prime is 22021221032131. The reversal of 22021221032101 is 10123012212022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21752886672001 + 268334360100 = 4663999^2 + 518010^2 .
It is a cyclic number.
It is not a de Polignac number, because 22021221032101 - 213 = 22021221023909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22021221032131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11010610516050 + 11010610516051.
It is an arithmetic number, because the mean of its divisors is an integer number (11010610516051).
Almost surely, 222021221032101 is an apocalyptic number.
It is an amenable number.
22021221032101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22021221032101 is an equidigital number, since it uses as much as digits as its factorization.
22021221032101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 22021221032101 its reverse (10123012212022), we get a palindrome (32144233244123).
The spelling of 22021221032101 in words is "twenty-two trillion, twenty-one billion, two hundred twenty-one million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •