Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …01101110010010101100101 |
3 | 2121211002002220201102210222 |
4 | 10203003121031302111211 |
5 | 10110144033033000401 |
6 | 110312201004454125 |
7 | 4133011502622326 |
oct | 443033115622545 |
9 | 77732086642728 |
10 | 20001012000101 |
11 | 6411421937760 |
12 | 22b03b654a345 |
13 | b21119b62c72 |
14 | 4d20a881044d |
15 | 24a413b37c1b |
hex | 1230d9372565 |
20001012000101 has 32 divisors (see below), whose sum is σ = 23905337777280. Its totient is φ = 16518965299200.
The previous prime is 20001012000089. The next prime is 20001012000107. The reversal of 20001012000101 is 10100021010002.
It is a cyclic number.
It is not a de Polignac number, because 20001012000101 - 234 = 19983832130917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001012000107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21546566 + ... + 22455656.
It is an arithmetic number, because the mean of its divisors is an integer number (747041805540).
Almost surely, 220001012000101 is an apocalyptic number.
It is an amenable number.
20001012000101 is a deficient number, since it is larger than the sum of its proper divisors (3904325777179).
20001012000101 is a wasteful number, since it uses less digits than its factorization.
20001012000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913205.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20001012000101 its reverse (10100021010002), we get a palindrome (30101033010103).
Subtracting from 20001012000101 its reverse (10100021010002), we obtain a palindrome (9900990990099).
It can be divided in two parts, 2000 and 1012000101, that added together give a palindrome (1012002101).
The spelling of 20001012000101 in words is "twenty trillion, one billion, twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •