Base | Representation |
---|---|
bin | 1001001001010011101100… |
… | …10001100101001010010111 |
3 | 2122012121001122102211002220 |
4 | 10210221312101211022113 |
5 | 10113444332411400043 |
6 | 110434513043433423 |
7 | 4143654565450605 |
oct | 444516621451227 |
9 | 78177048384086 |
10 | 20111021200023 |
11 | 64540441a0906 |
12 | 2309798385873 |
13 | b2b5cc2314c0 |
14 | 4d7542d0a875 |
15 | 24d20194b483 |
hex | 124a76465297 |
20111021200023 has 16 divisors (see below), whose sum is σ = 28975921346400. Its totient is φ = 12333774086784.
The previous prime is 20111021199989. The next prime is 20111021200031. The reversal of 20111021200023 is 32000212011102.
It is not a de Polignac number, because 20111021200023 - 216 = 20111021134487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111021199975 and 20111021200011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111021200033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 879966748 + ... + 879989601.
It is an arithmetic number, because the mean of its divisors is an integer number (1810995084150).
Almost surely, 220111021200023 is an apocalyptic number.
20111021200023 is a deficient number, since it is larger than the sum of its proper divisors (8864900146377).
20111021200023 is a wasteful number, since it uses less digits than its factorization.
20111021200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759956658.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20111021200023 its reverse (32000212011102), we get a palindrome (52111233211125).
The spelling of 20111021200023 in words is "twenty trillion, one hundred eleven billion, twenty-one million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •