Base | Representation |
---|---|
bin | 110000000001011001011001… |
… | …010011100101011111010011 |
3 | 1000200210201211212010012111121 |
4 | 300001121121103211133103 |
5 | 210140314121322320034 |
6 | 2025104543244023111 |
7 | 62325566621253232 |
oct | 6001313123453723 |
9 | 1020721755105447 |
10 | 211202220120019 |
11 | 613283a4255497 |
12 | 1b8304a4231a97 |
13 | 90b038c95968b |
14 | 3a22356074b19 |
15 | 1963cc3a611b4 |
hex | c016594e57d3 |
211202220120019 has 2 divisors, whose sum is σ = 211202220120020. Its totient is φ = 211202220120018.
The previous prime is 211202220119953. The next prime is 211202220120041. The reversal of 211202220120019 is 910021022202112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211202220120019 - 29 = 211202220119507 is a prime.
It is a super-2 number, since 2×2112022201200192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211202220119975 and 211202220120002.
It is not a weakly prime, because it can be changed into another prime (211202220120719) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105601110060009 + 105601110060010.
It is an arithmetic number, because the mean of its divisors is an integer number (105601110060010).
Almost surely, 2211202220120019 is an apocalyptic number.
211202220120019 is a deficient number, since it is larger than the sum of its proper divisors (1).
211202220120019 is an equidigital number, since it uses as much as digits as its factorization.
211202220120019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 211202220120019 in words is "two hundred eleven trillion, two hundred two billion, two hundred twenty million, one hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •