Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …001101110110110001111 |
3 | 21011022010201122001210111 |
4 | 131123020221232312033 |
5 | 231112024224341421 |
6 | 4144521111020451 |
7 | 266041033010353 |
oct | 35331051566617 |
9 | 7138121561714 |
10 | 2022001012111 |
11 | 70a586948923 |
12 | 287a6406a727 |
13 | 11889b67bc32 |
14 | 6dc18815463 |
15 | 378e475aee1 |
hex | 1d6c8a6ed8f |
2022001012111 has 8 divisors (see below), whose sum is σ = 2084146628960. Its totient is φ = 1960249971168.
The previous prime is 2022001012039. The next prime is 2022001012117. The reversal of 2022001012111 is 1112101002202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2022001012111 - 217 = 2022000881039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022001012091 and 2022001012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022001012117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98633571 + ... + 98654068.
It is an arithmetic number, because the mean of its divisors is an integer number (260518328620).
Almost surely, 22022001012111 is an apocalyptic number.
2022001012111 is a deficient number, since it is larger than the sum of its proper divisors (62145616849).
2022001012111 is a wasteful number, since it uses less digits than its factorization.
2022001012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197287953.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2022001012111 its reverse (1112101002202), we get a palindrome (3134102014313).
Subtracting from 2022001012111 its reverse (1112101002202), we obtain a palindrome (909900009909).
The spelling of 2022001012111 in words is "two trillion, twenty-two billion, one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •