Base | Representation |
---|---|
bin | 1001000110011001011010… |
… | …10101110001000111111111 |
3 | 2121212000220220221202221002 |
4 | 10203030231111301013333 |
5 | 10110330023402004043 |
6 | 110320533235400515 |
7 | 4133514364443125 |
oct | 443145525610777 |
9 | 77760826852832 |
10 | 20011013313023 |
11 | 6415694369127 |
12 | 22b2327a5313b |
13 | b22051bbcbc5 |
14 | 4d2776bd5915 |
15 | 24a7ebba4bb8 |
hex | 12332d5711ff |
20011013313023 has 2 divisors, whose sum is σ = 20011013313024. Its totient is φ = 20011013313022.
The previous prime is 20011013313017. The next prime is 20011013313073. The reversal of 20011013313023 is 32031331011002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20011013313023 - 24 = 20011013313007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20011013312986 and 20011013313004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20011013313073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005506656511 + 10005506656512.
It is an arithmetic number, because the mean of its divisors is an integer number (10005506656512).
Almost surely, 220011013313023 is an apocalyptic number.
20011013313023 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011013313023 is an equidigital number, since it uses as much as digits as its factorization.
20011013313023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20011013313023 its reverse (32031331011002), we get a palindrome (52042344324025).
The spelling of 20011013313023 in words is "twenty trillion, eleven billion, thirteen million, three hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •