Base | Representation |
---|---|
bin | 1001001110110101110010… |
… | …00011010101011010110101 |
3 | 2122212202201222001111202211 |
4 | 10213122321003111122311 |
5 | 10130103143221200041 |
6 | 111102112242533421 |
7 | 4163464452444055 |
oct | 447327103253265 |
9 | 78782658044684 |
10 | 20301120100021 |
11 | 6517725058032 |
12 | 233a5b0067271 |
13 | b435061b0107 |
14 | 502818051565 |
15 | 25312aa4b481 |
hex | 1276b90d56b5 |
20301120100021 has 2 divisors, whose sum is σ = 20301120100022. Its totient is φ = 20301120100020.
The previous prime is 20301120099991. The next prime is 20301120100081. The reversal of 20301120100021 is 12000102110302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14255230872100 + 6045889227921 = 3775610^2 + 2458839^2 .
It is a cyclic number.
It is not a de Polignac number, because 20301120100021 - 25 = 20301120099989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20301120099974 and 20301120100010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20301120100081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10150560050010 + 10150560050011.
It is an arithmetic number, because the mean of its divisors is an integer number (10150560050011).
Almost surely, 220301120100021 is an apocalyptic number.
It is an amenable number.
20301120100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20301120100021 is an equidigital number, since it uses as much as digits as its factorization.
20301120100021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20301120100021 its reverse (12000102110302), we get a palindrome (32301222210323).
The spelling of 20301120100021 in words is "twenty trillion, three hundred one billion, one hundred twenty million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •