Base | Representation |
---|---|
bin | 11101010001110100100… |
… | …110110010110010101101 |
3 | 21010100022210212220000002 |
4 | 131101310212302302231 |
5 | 230431034230133401 |
6 | 4140144524314045 |
7 | 265235155333541 |
oct | 35216446626255 |
9 | 7110283786002 |
10 | 2012001021101 |
11 | 70631513a645 |
12 | 285b330a2925 |
13 | 1179669958a6 |
14 | 6d54a695a21 |
15 | 3750b8a0a6b |
hex | 1d4749b2cad |
2012001021101 has 16 divisors (see below), whose sum is σ = 2061215227440. Its totient is φ = 1963209830400.
The previous prime is 2012001021091. The next prime is 2012001021113. The reversal of 2012001021101 is 1011201002102.
It can be written as a sum of positive squares in 8 ways, for example, as 130248088201 + 1881752932900 = 360899^2 + 1371770^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012001021101 is a prime.
It is a super-2 number, since 2×20120010211012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012001020101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35456051 + ... + 35512751.
It is an arithmetic number, because the mean of its divisors is an integer number (128825951715).
Almost surely, 22012001021101 is an apocalyptic number.
It is an amenable number.
2012001021101 is a deficient number, since it is larger than the sum of its proper divisors (49214206339).
2012001021101 is a wasteful number, since it uses less digits than its factorization.
2012001021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60416.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2012001021101 its reverse (1011201002102), we get a palindrome (3023202023203).
The spelling of 2012001021101 in words is "two trillion, twelve billion, one million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •