Base | Representation |
---|---|
bin | 1001001011111011011110… |
… | …11001000001000100000101 |
3 | 2122112012120101122002200111 |
4 | 10211331233121001010011 |
5 | 10121433323101201041 |
6 | 110544131321313021 |
7 | 4153324043013112 |
oct | 445755731010405 |
9 | 78465511562614 |
10 | 20201100022021 |
11 | 6489269359046 |
12 | 2323137635771 |
13 | b36c564908c9 |
14 | 4dba4a485909 |
15 | 250724b97981 |
hex | 125f6f641105 |
20201100022021 has 2 divisors, whose sum is σ = 20201100022022. Its totient is φ = 20201100022020.
The previous prime is 20201100022009. The next prime is 20201100022073. The reversal of 20201100022021 is 12022000110202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10138970430625 + 10062129591396 = 3184175^2 + 3172086^2 .
It is a cyclic number.
It is not a de Polignac number, because 20201100022021 - 215 = 20201099989253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201100021992 and 20201100022010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20201100023021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100550011010 + 10100550011011.
It is an arithmetic number, because the mean of its divisors is an integer number (10100550011011).
Almost surely, 220201100022021 is an apocalyptic number.
It is an amenable number.
20201100022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20201100022021 is an equidigital number, since it uses as much as digits as its factorization.
20201100022021 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 13.
Adding to 20201100022021 its reverse (12022000110202), we get a palindrome (32223100132223).
The spelling of 20201100022021 in words is "twenty trillion, two hundred one billion, one hundred million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •