Base | Representation |
---|---|
bin | 110010100000001010000000… |
… | …110101010011011000100111 |
3 | 1002010102201011011020201010102 |
4 | 302200022000311103120213 |
5 | 213103041040122431043 |
6 | 2104220520141014315 |
7 | 64533032621003063 |
oct | 6240120065233047 |
9 | 1063381134221112 |
10 | 222112100202023 |
11 | 64854238128129 |
12 | 20ab2990b5439b |
13 | 96c2109462965 |
14 | 3cbc3d6814aa3 |
15 | 1aa29a35a26b8 |
hex | ca0280d53627 |
222112100202023 has 2 divisors, whose sum is σ = 222112100202024. Its totient is φ = 222112100202022.
The previous prime is 222112100201863. The next prime is 222112100202101. The reversal of 222112100202023 is 320202001211222.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222112100202023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222112100201986 and 222112100202004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222112100202623) 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, 111056050101011 + 111056050101012.
It is an arithmetic number, because the mean of its divisors is an integer number (111056050101012).
Almost surely, 2222112100202023 is an apocalyptic number.
222112100202023 is a deficient number, since it is larger than the sum of its proper divisors (1).
222112100202023 is an equidigital number, since it uses as much as digits as its factorization.
222112100202023 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 222112100202023 its reverse (320202001211222), we get a palindrome (542314101413245).
The spelling of 222112100202023 in words is "two hundred twenty-two trillion, one hundred twelve billion, one hundred million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •