Base | Representation |
---|---|
bin | 1001000110000100111011… |
… | …00011101111010101011101 |
3 | 2121210222112011101120012011 |
4 | 10203002131203233111131 |
5 | 10110140010321401023 |
6 | 110311513412311221 |
7 | 4132644630403366 |
oct | 443023543572535 |
9 | 77728464346164 |
10 | 20000011122013 |
11 | 6410a5897418a |
12 | 22b0177312511 |
13 | b20cba6a9200 |
14 | 4d2011914b6d |
15 | 24a3a5d3150d |
hex | 12309d8ef55d |
20000011122013 has 12 divisors (see below), whose sum is σ = 21930953712960. Its totient is φ = 18227858225616.
The previous prime is 20000011122001. The next prime is 20000011122017. The reversal of 20000011122013 is 31022111000002.
It is not a de Polignac number, because 20000011122013 - 29 = 20000011121501 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20000011121984 and 20000011122002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000011122017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 748994631 + ... + 749021332.
It is an arithmetic number, because the mean of its divisors is an integer number (1827579476080).
Almost surely, 220000011122013 is an apocalyptic number.
It is an amenable number.
20000011122013 is a deficient number, since it is larger than the sum of its proper divisors (1930942590947).
20000011122013 is a wasteful number, since it uses less digits than its factorization.
20000011122013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1498016068 (or 1498016055 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20000011122013 its reverse (31022111000002), we get a palindrome (51022122122015).
The spelling of 20000011122013 in words is "twenty trillion, eleven million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.345 sec. • engine limits •