Base | Representation |
---|---|
bin | 1010000000111011011001… |
… | …01101100100100001110111 |
3 | 2212222021221111021100201211 |
4 | 11000131230231210201313 |
5 | 10341302301012241043 |
6 | 114500453421302251 |
7 | 4432021456515322 |
oct | 500355455444167 |
9 | 85867844240654 |
10 | 22022121212023 |
11 | 7020590343929 |
12 | 257804ba04987 |
13 | c398a582987a |
14 | 561c3aa017b9 |
15 | 282ca4e36a9d |
hex | 14076cb64877 |
22022121212023 has 2 divisors, whose sum is σ = 22022121212024. Its totient is φ = 22022121212022.
The previous prime is 22022121211999. The next prime is 22022121212029. The reversal of 22022121212023 is 32021212122022.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 22022121212023 - 233 = 22013531277431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22022121211985 and 22022121212003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22022121212029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011060606011 + 11011060606012.
It is an arithmetic number, because the mean of its divisors is an integer number (11011060606012).
Almost surely, 222022121212023 is an apocalyptic number.
22022121212023 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022121212023 is an equidigital number, since it uses as much as digits as its factorization.
22022121212023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 22022121212023 its reverse (32021212122022), we get a palindrome (54043333334045).
Subtracting 22022121212023 from its reverse (32021212122022), we obtain a palindrome (9999090909999).
The spelling of 22022121212023 in words is "twenty-two trillion, twenty-two billion, one hundred twenty-one million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •