Base | Representation |
---|---|
bin | 1010000000010010011000… |
… | …01101001000101100100101 |
3 | 2212220012002212100210100102 |
4 | 11000021030031020230211 |
5 | 10340422201324031041 |
6 | 114442412403553445 |
7 | 4430312004024332 |
oct | 500111415105445 |
9 | 85805085323312 |
10 | 22000101002021 |
11 | 701221052416a |
12 | 257392538b885 |
13 | c377a674c9cc |
14 | 560b4c2bd989 |
15 | 282416b6509b |
hex | 14024c348b25 |
22000101002021 has 2 divisors, whose sum is σ = 22000101002022. Its totient is φ = 22000101002020.
The previous prime is 22000101001951. The next prime is 22000101002107. The reversal of 22000101002021 is 12020010100022.
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., 21840536704996 + 159564297025 = 4673386^2 + 399455^2 .
It is a cyclic number.
It is not a de Polignac number, because 22000101002021 - 226 = 22000033893157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22000101001993 and 22000101002011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22000101002921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000050501010 + 11000050501011.
It is an arithmetic number, because the mean of its divisors is an integer number (11000050501011).
Almost surely, 222000101002021 is an apocalyptic number.
It is an amenable number.
22000101002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
22000101002021 is an equidigital number, since it uses as much as digits as its factorization.
22000101002021 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 11.
Adding to 22000101002021 its reverse (12020010100022), we get a palindrome (34020111102043).
The spelling of 22000101002021 in words is "twenty-two trillion, one hundred one million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •