Base | Representation |
---|---|
bin | 1010000000101001001001… |
… | …00010001000101001100101 |
3 | 2212221100122110011110112201 |
4 | 11000110210202020221211 |
5 | 10341122213000220401 |
6 | 114452153110214501 |
7 | 4431223550354356 |
oct | 500244442105145 |
9 | 85840573143481 |
10 | 22012320320101 |
11 | 7017410a62751 |
12 | 2576175654431 |
13 | c389a3173737 |
14 | 56158b0abd2d |
15 | 2828ce7a8b01 |
hex | 140524888a65 |
22012320320101 has 2 divisors, whose sum is σ = 22012320320102. Its totient is φ = 22012320320100.
The previous prime is 22012320320093. The next prime is 22012320320119. The reversal of 22012320320101 is 10102302321022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20243034599076 + 1769285721025 = 4499226^2 + 1330145^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012320320101 - 23 = 22012320320093 is a prime.
It is a super-2 number, since 2×220123203201012 (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 (22012320320401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006160160050 + 11006160160051.
It is an arithmetic number, because the mean of its divisors is an integer number (11006160160051).
Almost surely, 222012320320101 is an apocalyptic number.
It is an amenable number.
22012320320101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22012320320101 is an equidigital number, since it uses as much as digits as its factorization.
22012320320101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 22012320320101 its reverse (10102302321022), we get a palindrome (32114622641123).
The spelling of 22012320320101 in words is "twenty-two trillion, twelve billion, three hundred twenty million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •