Base | Representation |
---|---|
bin | 1001000110011001011011… |
… | …10011111001100101110101 |
3 | 2121212000221110211002022120 |
4 | 10203030231303321211311 |
5 | 10110330032412241041 |
6 | 110320534120550153 |
7 | 4133514521542230 |
oct | 443145563714565 |
9 | 77760843732276 |
10 | 20011021212021 |
11 | 6415698873824 |
12 | 22b232a622359 |
13 | b22053727378 |
14 | 4d2777c90417 |
15 | 24a7ec715366 |
hex | 12332dcf9975 |
20011021212021 has 64 divisors (see below), whose sum is σ = 31804665446400. Its totient is φ = 10950928358400.
The previous prime is 20011021212011. The next prime is 20011021212043. The reversal of 20011021212021 is 12021212011002.
It is not a de Polignac number, because 20011021212021 - 210 = 20011021210997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011021212011) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 57373885 + ... + 57721613.
It is an arithmetic number, because the mean of its divisors is an integer number (496947897600).
Almost surely, 220011021212021 is an apocalyptic number.
20011021212021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20011021212021 is a deficient number, since it is larger than the sum of its proper divisors (11793644234379).
20011021212021 is a wasteful number, since it uses less digits than its factorization.
20011021212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348690.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20011021212021 its reverse (12021212011002), we get a palindrome (32032233223023).
It can be divided in two parts, 2001102 and 1212021, that added together give a palindrome (3213123).
The spelling of 20011021212021 in words is "twenty trillion, eleven billion, twenty-one million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •