Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01010110111111001011101 |
3 | 2122011122020122211110001012 |
4 | 10210200202022313321131 |
5 | 10113313342134033041 |
6 | 110430140424025005 |
7 | 4143152006520455 |
oct | 444404212677135 |
9 | 78148218743035 |
10 | 20101020221021 |
11 | 644a881978303 |
12 | 2307867002165 |
13 | b2a69729054c |
14 | 4d6c749b0d65 |
15 | 24cd189483eb |
hex | 1248222b7e5d |
20101020221021 has 2 divisors, whose sum is σ = 20101020221022. Its totient is φ = 20101020221020.
The previous prime is 20101020220933. The next prime is 20101020221047. The reversal of 20101020221021 is 12012202010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11883704925625 + 8217315295396 = 3447275^2 + 2866586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101020221021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101020220987 and 20101020221005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101020227021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050510110510 + 10050510110511.
It is an arithmetic number, because the mean of its divisors is an integer number (10050510110511).
Almost surely, 220101020221021 is an apocalyptic number.
It is an amenable number.
20101020221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101020221021 is an equidigital number, since it uses as much as digits as its factorization.
20101020221021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20101020221021 its reverse (12012202010102), we get a palindrome (32113222231123).
The spelling of 20101020221021 in words is "twenty trillion, one hundred one billion, twenty million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •