Base | Representation |
---|---|
bin | 1001000110101010101111… |
… | …00010110001111101011101 |
3 | 2121212220220220202112221111 |
4 | 10203111113202301331131 |
5 | 10111003044143130411 |
6 | 110325112023502021 |
7 | 4134263656156504 |
oct | 443252742617535 |
9 | 77786826675844 |
10 | 20020311301981 |
11 | 641962588a921 |
12 | 22b40a18b7911 |
13 | b22ba4315813 |
14 | 4d2db9a1983b |
15 | 24ab930e4721 |
hex | 1235578b1f5d |
20020311301981 has 2 divisors, whose sum is σ = 20020311301982. Its totient is φ = 20020311301980.
The previous prime is 20020311301889. The next prime is 20020311302009. The reversal of 20020311301981 is 18910311302002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14522646317881 + 5497664984100 = 3810859^2 + 2344710^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020311301981 - 29 = 20020311301469 is a prime.
It is a super-2 number, since 2×200203113019812 (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 (20020311101981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010155650990 + 10010155650991.
It is an arithmetic number, because the mean of its divisors is an integer number (10010155650991).
Almost surely, 220020311301981 is an apocalyptic number.
It is an amenable number.
20020311301981 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020311301981 is an equidigital number, since it uses as much as digits as its factorization.
20020311301981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 31.
Adding to 20020311301981 its reverse (18910311302002), we get a palindrome (38930622603983).
The spelling of 20020311301981 in words is "twenty trillion, twenty billion, three hundred eleven million, three hundred one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •