Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …100001101100100100001 |
3 | 21010020202012020102212022 |
4 | 131100321010031210201 |
5 | 230422013014200001 |
6 | 4135501442111225 |
7 | 265201335545246 |
oct | 35207104154441 |
9 | 7106665212768 |
10 | 2011002100001 |
11 | 705952293414 |
12 | 2858b464b515 |
13 | 117837a4580b |
14 | 6d493b495cd |
15 | 3749dd3411b |
hex | 1d43910d921 |
2011002100001 has 6 divisors (see below), whose sum is σ = 2044509798006. Its totient is φ = 1978034848800.
The previous prime is 2011002099947. The next prime is 2011002100127. The reversal of 2011002100001 is 1000012001102.
It can be written as a sum of positive squares in 3 ways, for example, as 101409765601 + 1909592334400 = 318449^2 + 1381880^2 .
It is not a de Polignac number, because 2011002100001 - 210 = 2011002098977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011002100201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 270219620 + ... + 270227061.
It is an arithmetic number, because the mean of its divisors is an integer number (340751633001).
Almost surely, 22011002100001 is an apocalyptic number.
It is an amenable number.
2011002100001 is a deficient number, since it is larger than the sum of its proper divisors (33507698005).
2011002100001 is an frugal number, since it uses more digits than its factorization.
2011002100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540446803 (or 540446742 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 2011002100001 its reverse (1000012001102), we get a palindrome (3011014101103).
The spelling of 2011002100001 in words is "two trillion, eleven billion, two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •