Base | Representation |
---|---|
bin | 1001001011111011011111… |
… | …11111110101111100100101 |
3 | 2122112012121002210012101102 |
4 | 10211331233333311330211 |
5 | 10121433333202400401 |
6 | 110544132323405445 |
7 | 4153324225353605 |
oct | 445755777657445 |
9 | 78465532705342 |
10 | 20201110200101 |
11 | 648927407aa86 |
12 | 232313ab23885 |
13 | b36c5861553c |
14 | 4dba4b974c05 |
15 | 250725a0856b |
hex | 125f6fff5f25 |
20201110200101 has 8 divisors (see below), whose sum is σ = 20256327262080. Its totient is φ = 20145894079968.
The previous prime is 20201110200083. The next prime is 20201110200133. The reversal of 20201110200101 is 10100201110202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20201110200101 - 214 = 20201110183717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201110200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79739705 + ... + 79992641.
It is an arithmetic number, because the mean of its divisors is an integer number (2532040907760).
Almost surely, 220201110200101 is an apocalyptic number.
It is an amenable number.
20201110200101 is a deficient number, since it is larger than the sum of its proper divisors (55217061979).
20201110200101 is a wasteful number, since it uses less digits than its factorization.
20201110200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470923.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20201110200101 its reverse (10100201110202), we get a palindrome (30301311310303).
The spelling of 20201110200101 in words is "twenty trillion, two hundred one billion, one hundred ten million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •