Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …101000011000111110111 |
3 | 21011022122200011010220121 |
4 | 131123110211003013313 |
5 | 231112431441023111 |
6 | 4144553015512411 |
7 | 266046012556213 |
oct | 35332445030767 |
9 | 7138580133817 |
10 | 2022201111031 |
11 | 70a679899132 |
12 | 287abb088707 |
13 | 118900c6c26a |
14 | 6dc37221943 |
15 | 379070d4871 |
hex | 1d6d49431f7 |
2022201111031 has 2 divisors, whose sum is σ = 2022201111032. Its totient is φ = 2022201111030.
The previous prime is 2022201111011. The next prime is 2022201111041. The reversal of 2022201111031 is 1301111022202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2022201111031 - 27 = 2022201110903 is a prime.
It is a super-2 number, since 2×20222011110312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2022201110996 and 2022201111014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2022201111011) 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, 1011100555515 + 1011100555516.
It is an arithmetic number, because the mean of its divisors is an integer number (1011100555516).
Almost surely, 22022201111031 is an apocalyptic number.
2022201111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022201111031 is an equidigital number, since it uses as much as digits as its factorization.
2022201111031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2022201111031 its reverse (1301111022202), we get a palindrome (3323312133233).
The spelling of 2022201111031 in words is "two trillion, twenty-two billion, two hundred one million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •