Base | Representation |
---|---|
bin | 110010000001101111011101… |
… | …010001110111110100100111 |
3 | 1001212000220020121222011120102 |
4 | 302001233131101313310213 |
5 | 212314320030020401043 |
6 | 2055540413513254315 |
7 | 64226031215313653 |
oct | 6201573521676447 |
9 | 1055026217864512 |
10 | 220022002122023 |
11 | 64118897266302 |
12 | 208158a340439b |
13 | 959cca798871a |
14 | 3c4919c015a63 |
15 | 1a684258226b8 |
hex | c81bdd477d27 |
220022002122023 has 2 divisors, whose sum is σ = 220022002122024. Its totient is φ = 220022002122022.
The previous prime is 220022002122001. The next prime is 220022002122029. The reversal of 220022002122023 is 320221200220022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220022002122023 - 230 = 220020928380199 is a prime.
It is a super-2 number, since 2×2200220021220232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220022002121986 and 220022002122004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220022002122029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110011001061011 + 110011001061012.
It is an arithmetic number, because the mean of its divisors is an integer number (110011001061012).
Almost surely, 2220022002122023 is an apocalyptic number.
220022002122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
220022002122023 is an equidigital number, since it uses as much as digits as its factorization.
220022002122023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 220022002122023 its reverse (320221200220022), we get a palindrome (540243202342045).
The spelling of 220022002122023 in words is "two hundred twenty trillion, twenty-two billion, two million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •