Base | Representation |
---|---|
bin | 110010011110101011000001… |
… | …010001100000011000100111 |
3 | 1002010001221212201212101101202 |
4 | 302132223001101200120213 |
5 | 213044403142120401043 |
6 | 2104102011040113115 |
7 | 64522462202430335 |
oct | 6236530121403047 |
9 | 1063057781771352 |
10 | 222010102122023 |
11 | 64814a56946a46 |
12 | 20a9706600579b |
13 | 96b56029cba77 |
14 | 3cb74bc278b55 |
15 | 1a9eed3c341b8 |
hex | c9eac1460627 |
222010102122023 has 2 divisors, whose sum is σ = 222010102122024. Its totient is φ = 222010102122022.
The previous prime is 222010102122013. The next prime is 222010102122071. The reversal of 222010102122023 is 320221201010222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222010102122023 - 210 = 222010102120999 is a prime.
It is a super-2 number, since 2×2220101021220232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222010102121986 and 222010102122004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222010102122013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111005051061011 + 111005051061012.
It is an arithmetic number, because the mean of its divisors is an integer number (111005051061012).
Almost surely, 2222010102122023 is an apocalyptic number.
222010102122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
222010102122023 is an equidigital number, since it uses as much as digits as its factorization.
222010102122023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 222010102122023 its reverse (320221201010222), we get a palindrome (542231303132245).
The spelling of 222010102122023 in words is "two hundred twenty-two trillion, ten billion, one hundred two million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •