Base | Representation |
---|---|
bin | 11101010000111001101… |
… | …010000011011100100001 |
3 | 21010020202212220102112201 |
4 | 131100321222003130201 |
5 | 230422023034120001 |
6 | 4135502434453201 |
7 | 265201516062445 |
oct | 35207152033441 |
9 | 7106685812481 |
10 | 2011012020001 |
11 | 705957949466 |
12 | 2858b7a34201 |
13 | 117839b09b3a |
14 | 6d4951ac825 |
15 | 3749eb43501 |
hex | 1d439a83721 |
2011012020001 has 8 divisors (see below), whose sum is σ = 2080378944000. Its totient is φ = 1941646541520.
The previous prime is 2011012019981. The next prime is 2011012020013. The reversal of 2011012020001 is 1000202101102.
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 2011012020001 - 227 = 2010877802273 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2011012020001.
It is not an unprimeable number, because it can be changed into a prime (2011012020041) 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 7 ways as a sum of consecutive naturals, for example, 2998656 + ... + 3607486.
It is an arithmetic number, because the mean of its divisors is an integer number (260047368000).
Almost surely, 22011012020001 is an apocalyptic number.
It is an amenable number.
2011012020001 is a deficient number, since it is larger than the sum of its proper divisors (69366923999).
2011012020001 is a wasteful number, since it uses less digits than its factorization.
2011012020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722759.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2011012020001 its reverse (1000202101102), we get a palindrome (3011214121103).
The spelling of 2011012020001 in words is "two trillion, eleven billion, twelve million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •