Base | Representation |
---|---|
bin | 1001001011111011010101… |
… | …01000001000110110101101 |
3 | 2122112012100211020122022010 |
4 | 10211331222220020312231 |
5 | 10121433142121200023 |
6 | 110544115344311433 |
7 | 4153322052463254 |
oct | 445755250106655 |
9 | 78465324218263 |
10 | 20201020100013 |
11 | 64892282304a5 |
12 | 2323114912579 |
13 | b36c42a59b8c |
14 | 4dba3d9dd79b |
15 | 25071cb5c093 |
hex | 125f6aa08dad |
20201020100013 has 16 divisors (see below), whose sum is σ = 26992512340736. Its totient is φ = 13438466637120.
The previous prime is 20201020099991. The next prime is 20201020100021. The reversal of 20201020100013 is 31000102010202.
It is a de Polignac number, because none of the positive numbers 2k-20201020100013 is a prime.
It is a super-2 number, since 2×202010201000132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201020100213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 911893 + ... + 6421338.
It is an arithmetic number, because the mean of its divisors is an integer number (1687032021296).
Almost surely, 220201020100013 is an apocalyptic number.
It is an amenable number.
20201020100013 is a deficient number, since it is larger than the sum of its proper divisors (6791492240723).
20201020100013 is a wasteful number, since it uses less digits than its factorization.
20201020100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7335204.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 20201020100013 its reverse (31000102010202), we get a palindrome (51201122110215).
The spelling of 20201020100013 in words is "twenty trillion, two hundred one billion, twenty million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •