Base | Representation |
---|---|
bin | 1001000110000110110011… |
… | …10000100100111010000011 |
3 | 2121211002010112212210010212 |
4 | 10203003121300210322003 |
5 | 10110144042401321011 |
6 | 110312201532144335 |
7 | 4133011643265332 |
oct | 443033160447203 |
9 | 77732115783125 |
10 | 20001021120131 |
11 | 6411426aa6777 |
12 | 22b03b96080ab |
13 | b2111ba0712c |
14 | 4d20a9b05d19 |
15 | 24a41483a08b |
hex | 1230d9c24e83 |
20001021120131 has 2 divisors, whose sum is σ = 20001021120132. Its totient is φ = 20001021120130.
The previous prime is 20001021120127. The next prime is 20001021120167. The reversal of 20001021120131 is 13102112010002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20001021120131 - 22 = 20001021120127 is a prime.
It is a super-2 number, since 2×200010211201312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20001021140131) 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, 10000510560065 + 10000510560066.
It is an arithmetic number, because the mean of its divisors is an integer number (10000510560066).
Almost surely, 220001021120131 is an apocalyptic number.
20001021120131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001021120131 is an equidigital number, since it uses as much as digits as its factorization.
20001021120131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 20001021120131 its reverse (13102112010002), we get a palindrome (33103133130133).
The spelling of 20001021120131 in words is "twenty trillion, one billion, twenty-one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •