Base | Representation |
---|---|
bin | 11110101111000011101… |
… | …000110100111011100111 |
3 | 21110220201122212000001200 |
4 | 132233003220310323213 |
5 | 234101100431431043 |
6 | 4254142425053543 |
7 | 305411040666324 |
oct | 36570350647347 |
9 | 7426648760050 |
10 | 2112111202023 |
11 | 744817790259 |
12 | 2a14119272b3 |
13 | 12422c271b34 |
14 | 743261d7b4b |
15 | 39e1a6017d3 |
hex | 1ebc3a34ee7 |
2112111202023 has 12 divisors (see below), whose sum is σ = 3052862553000. Its totient is φ = 1407134783376.
The previous prime is 2112111202013. The next prime is 2112111202079. The reversal of 2112111202023 is 3202021112112.
It is not a de Polignac number, because 2112111202023 - 224 = 2112094424807 is a prime.
It is a super-2 number, since 2×21121112020232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2112111201987 and 2112111202005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112111202013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 78265036 + ... + 78292017.
It is an arithmetic number, because the mean of its divisors is an integer number (254405212750).
Almost surely, 22112111202023 is an apocalyptic number.
2112111202023 is a deficient number, since it is larger than the sum of its proper divisors (940751350977).
2112111202023 is a wasteful number, since it uses less digits than its factorization.
2112111202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156558558 (or 156558555 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 2112111202023 its reverse (3202021112112), we get a palindrome (5314132314135).
The spelling of 2112111202023 in words is "two trillion, one hundred twelve billion, one hundred eleven million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •