Base | Representation |
---|---|
bin | 1001000110010111111011… |
… | …00001001110100111001101 |
3 | 2121211221212000021121111010 |
4 | 10203023331201032213031 |
5 | 10110321403004323041 |
6 | 110320321455315433 |
7 | 4133455453131210 |
oct | 443137541164715 |
9 | 77757760247433 |
10 | 20010211011021 |
11 | 64153124a5820 |
12 | 22b214321bb79 |
13 | b21c549122aa |
14 | 4d26dc42b777 |
15 | 24a7a1525a16 |
hex | 1232fd84e9cd |
20010211011021 has 32 divisors (see below), whose sum is σ = 33264809625600. Its totient is φ = 10394576614080.
The previous prime is 20010211011013. The next prime is 20010211011023. The reversal of 20010211011021 is 12011011201002.
It is not a de Polignac number, because 20010211011021 - 23 = 20010211011013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20010211010988 and 20010211011006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010211011023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5785635 + ... + 8572863.
It is an arithmetic number, because the mean of its divisors is an integer number (1039525300800).
Almost surely, 220010211011021 is an apocalyptic number.
20010211011021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20010211011021 is a deficient number, since it is larger than the sum of its proper divisors (13254598614579).
20010211011021 is a wasteful number, since it uses less digits than its factorization.
20010211011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2818329.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20010211011021 its reverse (12011011201002), we get a palindrome (32021222212023).
The spelling of 20010211011021 in words is "twenty trillion, ten billion, two hundred eleven million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •