Base | Representation |
---|---|
bin | 1001000110010111100100… |
… | …01100011110010101010011 |
3 | 2121211221100202210010012002 |
4 | 10203023302030132111103 |
5 | 10110321010340133021 |
6 | 110320250551224215 |
7 | 4133450655214400 |
oct | 443136214362523 |
9 | 77757322703162 |
10 | 20010021021011 |
11 | 641522522a48a |
12 | 22b20ab67806b |
13 | b21c24451278 |
14 | 4d26c10d32a7 |
15 | 24a78e9e750b |
hex | 1232f231e553 |
20010021021011 has 24 divisors (see below), whose sum is σ = 24300513921024. Its totient is φ = 16397958025680.
The previous prime is 20010021020993. The next prime is 20010021021017. The reversal of 20010021021011 is 11012012001002.
It is not a de Polignac number, because 20010021021011 - 238 = 19735143114067 is a prime.
It is a super-2 number, since 2×200100210210112 (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 = 20010021020983 and 20010021021001.
It is not an unprimeable number, because it can be changed into a prime (20010021021017) 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, 1826285 + ... + 6584478.
It is an arithmetic number, because the mean of its divisors is an integer number (1012521413376).
Almost surely, 220010021021011 is an apocalyptic number.
20010021021011 is a deficient number, since it is larger than the sum of its proper divisors (4290492900013).
20010021021011 is a wasteful number, since it uses less digits than its factorization.
20010021021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8412911 (or 8412904 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20010021021011 its reverse (11012012001002), we get a palindrome (31022033022013).
The spelling of 20010021021011 in words is "twenty trillion, ten billion, twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •