Base | Representation |
---|---|
bin | 1001001011111011011111… |
… | …00000100110101010001101 |
3 | 2122112012120112101011002011 |
4 | 10211331233200212222031 |
5 | 10121433324103323041 |
6 | 110544131432101221 |
7 | 4153324065636001 |
oct | 445755740465215 |
9 | 78465515334064 |
10 | 20201102011021 |
11 | 648926a497448 |
12 | 2323138234811 |
13 | b36c56a09029 |
14 | 4dba4a842701 |
15 | 250724e3be81 |
hex | 125f6f826a8d |
20201102011021 has 2 divisors, whose sum is σ = 20201102011022. Its totient is φ = 20201102011020.
The previous prime is 20201102010983. The next prime is 20201102011063. The reversal of 20201102011021 is 12011020110202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15829297746025 + 4371804264996 = 3978605^2 + 2090886^2 .
It is a cyclic number.
It is not a de Polignac number, because 20201102011021 - 27 = 20201102010893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201102010992 and 20201102011010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20201102011091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100551005510 + 10100551005511.
It is an arithmetic number, because the mean of its divisors is an integer number (10100551005511).
Almost surely, 220201102011021 is an apocalyptic number.
It is an amenable number.
20201102011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20201102011021 is an equidigital number, since it uses as much as digits as its factorization.
20201102011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20201102011021 its reverse (12011020110202), we get a palindrome (32212122121223).
The spelling of 20201102011021 in words is "twenty trillion, two hundred one billion, one hundred two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •