Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …01010100110000000000101 |
3 | 2122112021220021021001001111 |
4 | 10211332211022212000011 |
5 | 10121442200031221241 |
6 | 110544401030325021 |
7 | 4153355306336134 |
oct | 445764512460005 |
9 | 78467807231044 |
10 | 20202002210821 |
11 | 6489691645922 |
12 | 23233497b9771 |
13 | b3706b372632 |
14 | 4dbad421191b |
15 | 250778ea7c81 |
hex | 125fa52a6005 |
20202002210821 has 2 divisors, whose sum is σ = 20202002210822. Its totient is φ = 20202002210820.
The previous prime is 20202002210809. The next prime is 20202002210827. The reversal of 20202002210821 is 12801220020202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19813306073796 + 388696137025 = 4451214^2 + 623455^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202002210821 - 227 = 20201867993093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20202002210792 and 20202002210801.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20202002210827) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10101001105410 + 10101001105411.
It is an arithmetic number, because the mean of its divisors is an integer number (10101001105411).
Almost surely, 220202002210821 is an apocalyptic number.
It is an amenable number.
20202002210821 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202002210821 is an equidigital number, since it uses as much as digits as its factorization.
20202002210821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
The spelling of 20202002210821 in words is "twenty trillion, two hundred two billion, two million, two hundred ten thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •