Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …00011000100111001000111 |
3 | 2121212220010021212122001201 |
4 | 10203111011003010321013 |
5 | 10111001430224013111 |
6 | 110325021141003331 |
7 | 4134253200515143 |
oct | 443250503047107 |
9 | 77786107778051 |
10 | 20020001001031 |
11 | 6419486710159 |
12 | 22b40159b3547 |
13 | b22b54c4c1a5 |
14 | 4d2d8a724223 |
15 | 24ab75c4d6c1 |
hex | 1235450c4e47 |
20020001001031 has 2 divisors, whose sum is σ = 20020001001032. Its totient is φ = 20020001001030.
The previous prime is 20020001001017. The next prime is 20020001001061. The reversal of 20020001001031 is 13010010002002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20020001001031 - 27 = 20020001000903 is a prime.
It is a super-2 number, since 2×200200010010312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20020001000999 and 20020001001017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020001001061) 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, 10010000500515 + 10010000500516.
It is an arithmetic number, because the mean of its divisors is an integer number (10010000500516).
Almost surely, 220020001001031 is an apocalyptic number.
20020001001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020001001031 is an equidigital number, since it uses as much as digits as its factorization.
20020001001031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 20020001001031 its reverse (13010010002002), we get a palindrome (33030011003033).
The spelling of 20020001001031 in words is "twenty trillion, twenty billion, one million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •