Base | Representation |
---|---|
bin | 1100111011100000011… |
… | …1001001000100110111 |
3 | 210020100202221112202211 |
4 | 3032320013021010313 |
5 | 12114411321241043 |
6 | 250013544114251 |
7 | 22022433435331 |
oct | 3167007110467 |
9 | 706322845684 |
10 | 222132212023 |
11 | 8622992a717 |
12 | 37073765987 |
13 | 17c40682717 |
14 | aa7363a451 |
15 | 5ba14bba9d |
hex | 33b81c9137 |
222132212023 has 2 divisors, whose sum is σ = 222132212024. Its totient is φ = 222132212022.
The previous prime is 222132211999. The next prime is 222132212051. The reversal of 222132212023 is 320212231222.
222132212023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222132212023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222132211985 and 222132212003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222132210023) 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, 111066106011 + 111066106012.
It is an arithmetic number, because the mean of its divisors is an integer number (111066106012).
Almost surely, 2222132212023 is an apocalyptic number.
222132212023 is a deficient number, since it is larger than the sum of its proper divisors (1).
222132212023 is an equidigital number, since it uses as much as digits as its factorization.
222132212023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 222132212023 its reverse (320212231222), we get a palindrome (542344443245).
The spelling of 222132212023 in words is "two hundred twenty-two billion, one hundred thirty-two million, two hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.327 sec. • engine limits •