Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …01011010011010001011101 |
3 | 2122012200120221010212211111 |
4 | 10210222300223103101131 |
5 | 10114003334230133041 |
6 | 110435154204422021 |
7 | 4144021064005600 |
oct | 444526053232135 |
9 | 78180527125744 |
10 | 20112001021021 |
11 | 64544a7291928 |
12 | 2309a10547911 |
13 | b2b727224940 |
14 | 4d75d70c4337 |
15 | 24d25c993981 |
hex | 124ab0ad345d |
20112001021021 has 24 divisors (see below), whose sum is σ = 25195706242560. Its totient is φ = 15912506407392.
The previous prime is 20112001021019. The next prime is 20112001021033. The reversal of 20112001021021 is 12012010021102.
It is not a de Polignac number, because 20112001021021 - 21 = 20112001021019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 20112001020992 and 20112001021010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112001021001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39649020 + ... + 40153066.
It is an arithmetic number, because the mean of its divisors is an integer number (1049821093440).
Almost surely, 220112001021021 is an apocalyptic number.
It is an amenable number.
20112001021021 is a deficient number, since it is larger than the sum of its proper divisors (5083705221539).
20112001021021 is a wasteful number, since it uses less digits than its factorization.
20112001021021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566713 (or 566706 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20112001021021 its reverse (12012010021102), we get a palindrome (32124011042123).
The spelling of 20112001021021 in words is "twenty trillion, one hundred twelve billion, one million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •