Base | Representation |
---|---|
bin | 10010101110101001… |
… | …100101100110101101 |
3 | 1220220111112012002000 |
4 | 102232221211212231 |
5 | 312141130203301 |
6 | 13123255122513 |
7 | 1311226144101 |
oct | 225651454655 |
9 | 56814465060 |
10 | 20110006701 |
11 | 858a635754 |
12 | 3a92973439 |
13 | 1b86413065 |
14 | d8ab5d901 |
15 | 7ca74a786 |
hex | 4aea659ad |
20110006701 has 64 divisors (see below), whose sum is σ = 31369420800. Its totient is φ = 12721060800.
The previous prime is 20110006681. The next prime is 20110006747. The reversal of 20110006701 is 10760001102.
It is not a de Polignac number, because 20110006701 - 27 = 20110006573 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110006781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5494210 + ... + 5497868.
It is an arithmetic number, because the mean of its divisors is an integer number (490147200).
Almost surely, 220110006701 is an apocalyptic number.
It is an amenable number.
20110006701 is a deficient number, since it is larger than the sum of its proper divisors (11259414099).
20110006701 is a wasteful number, since it uses less digits than its factorization.
20110006701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3847 (or 3841 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
Adding to 20110006701 its reverse (10760001102), we get a palindrome (30870007803).
The spelling of 20110006701 in words is "twenty billion, one hundred ten million, six thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •