Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …00001011110111010101111 |
3 | 2122112002210010120221021212 |
4 | 10211330233001132322233 |
5 | 10121424120122023043 |
6 | 110543432223145035 |
7 | 4153255220636414 |
oct | 445745701367257 |
9 | 78462703527255 |
10 | 20200020111023 |
11 | 6488864814a15 |
12 | 2322a95a4517b |
13 | b36b13824a0c |
14 | 4db986c9610b |
15 | 2506aee7e018 |
hex | 125f2f05eeaf |
20200020111023 has 16 divisors (see below), whose sum is σ = 21492595385856. Its totient is φ = 18919172976000.
The previous prime is 20200020110987. The next prime is 20200020111031. The reversal of 20200020111023 is 32011102000202.
It is a happy number.
It is not a de Polignac number, because 20200020111023 - 212 = 20200020106927 is a prime.
It is a super-2 number, since 2×202000201110232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20200020110989 and 20200020111007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200020111923) 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, 2684090 + ... + 6899592.
It is an arithmetic number, because the mean of its divisors is an integer number (1343287211616).
Almost surely, 220200020111023 is an apocalyptic number.
20200020111023 is a deficient number, since it is larger than the sum of its proper divisors (1292575274833).
20200020111023 is a wasteful number, since it uses less digits than its factorization.
20200020111023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4216894.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 20200020111023 its reverse (32011102000202), we get a palindrome (52211122111225).
The spelling of 20200020111023 in words is "twenty trillion, two hundred billion, twenty million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •