Base | Representation |
---|---|
bin | 1001000110101010010111… |
… | …00010111010101001100101 |
3 | 2121212220101212222220121021 |
4 | 10203111023202322221211 |
5 | 10111002141130322411 |
6 | 110325040033251141 |
7 | 4134255663214333 |
oct | 443251342725145 |
9 | 77786355886537 |
10 | 20020110010981 |
11 | 64195321a5a23 |
12 | 22b4046403ab1 |
13 | b22b716c8a12 |
14 | 4d2d9adbcb53 |
15 | 24ab805d2a71 |
hex | 12354b8baa65 |
20020110010981 has 2 divisors, whose sum is σ = 20020110010982. Its totient is φ = 20020110010980.
The previous prime is 20020110010973. The next prime is 20020110010991. The reversal of 20020110010981 is 18901001102002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20016586520100 + 3523490881 = 4473990^2 + 59359^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020110010981 - 23 = 20020110010973 is a prime.
It is a super-2 number, since 2×200201100109812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020110010921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010055005490 + 10010055005491.
It is an arithmetic number, because the mean of its divisors is an integer number (10010055005491).
Almost surely, 220020110010981 is an apocalyptic number.
It is an amenable number.
20020110010981 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020110010981 is an equidigital number, since it uses as much as digits as its factorization.
20020110010981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 25.
Adding to 20020110010981 its reverse (18901001102002), we get a palindrome (38921111112983).
The spelling of 20020110010981 in words is "twenty trillion, twenty billion, one hundred ten million, ten thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •