Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …101000010111011000101 |
3 | 21011022122200011002210022 |
4 | 131123110211002323011 |
5 | 231112431441011323 |
6 | 4144553015504525 |
7 | 266046012553634 |
oct | 35332445027305 |
9 | 7138580132708 |
10 | 2022201110213 |
11 | 70a679898559 |
12 | 287abb088145 |
13 | 118900c6ba8b |
14 | 6dc3722151b |
15 | 379070d44c8 |
hex | 1d6d4942ec5 |
2022201110213 has 2 divisors, whose sum is σ = 2022201110214. Its totient is φ = 2022201110212.
The previous prime is 2022201110207. The next prime is 2022201110261. The reversal of 2022201110213 is 3120111022202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1648969310884 + 373231799329 = 1284122^2 + 610927^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022201110213 - 222 = 2022196915909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2022201110191 and 2022201110200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2022201710213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1011100555106 + 1011100555107.
It is an arithmetic number, because the mean of its divisors is an integer number (1011100555107).
Almost surely, 22022201110213 is an apocalyptic number.
It is an amenable number.
2022201110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022201110213 is an equidigital number, since it uses as much as digits as its factorization.
2022201110213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 2022201110213 its reverse (3120111022202), we get a palindrome (5142312132415).
The spelling of 2022201110213 in words is "two trillion, twenty-two billion, two hundred one million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •