Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …11110010000010111001101 |
3 | 2121211000001002111222100202 |
4 | 10203002221132100113031 |
5 | 10110140413004323041 |
6 | 110311545312503245 |
7 | 4132652605416233 |
oct | 443025136202715 |
9 | 77730032458322 |
10 | 20000211011021 |
11 | 641105079080a |
12 | 22b021224ab25 |
13 | b2101cc24b27 |
14 | 4d20302a8953 |
15 | 24a3b8667a9b |
hex | 1230a97905cd |
20000211011021 has 8 divisors (see below), whose sum is σ = 20012939017344. Its totient is φ = 19987485186240.
The previous prime is 20000211011003. The next prime is 20000211011057. The reversal of 20000211011021 is 12011011200002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20000211011021 - 218 = 20000210748877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20000211010993 and 20000211011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000216011021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17996501 + ... + 19075493.
It is an arithmetic number, because the mean of its divisors is an integer number (2501617377168).
Almost surely, 220000211011021 is an apocalyptic number.
It is an amenable number.
20000211011021 is a deficient number, since it is larger than the sum of its proper divisors (12728006323).
20000211011021 is a wasteful number, since it uses less digits than its factorization.
20000211011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1090771.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20000211011021 its reverse (12011011200002), we get a palindrome (32011222211023).
The spelling of 20000211011021 in words is "twenty trillion, two hundred eleven million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •