Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01100100000010110001101 |
3 | 2122012200211222011010222011 |
4 | 10210222312230200112031 |
5 | 10114004041103000023 |
6 | 110435212213021221 |
7 | 4144023431216152 |
oct | 444526654402615 |
9 | 78180758133864 |
10 | 20112102000013 |
11 | 6454549291941 |
12 | 2309a3a324811 |
13 | b2b74211bc1a |
14 | 4d760668c229 |
15 | 24d26678d50d |
hex | 124ab6b2058d |
20112102000013 has 2 divisors, whose sum is σ = 20112102000014. Its totient is φ = 20112102000012.
The previous prime is 20112101999911. The next prime is 20112102000017. The reversal of 20112102000013 is 31000020121102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19503767518249 + 608334481764 = 4416307^2 + 779958^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112102000013 - 29 = 20112101999501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112101999957 and 20112102000002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112102000017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056051000006 + 10056051000007.
It is an arithmetic number, because the mean of its divisors is an integer number (10056051000007).
Almost surely, 220112102000013 is an apocalyptic number.
It is an amenable number.
20112102000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112102000013 is an equidigital number, since it uses as much as digits as its factorization.
20112102000013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20112102000013 its reverse (31000020121102), we get a palindrome (51112122121115).
The spelling of 20112102000013 in words is "twenty trillion, one hundred twelve billion, one hundred two million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •