Base | Representation |
---|---|
bin | 111011111011101… |
… | …1001101110110101 |
3 | 12012011001222212201 |
4 | 1313313121232311 |
5 | 13104304341041 |
6 | 531314544501 |
7 | 100556214544 |
oct | 16767315665 |
9 | 5164058781 |
10 | 2011012021 |
11 | 942189107 |
12 | 481598131 |
13 | 260831755 |
14 | 15112415b |
15 | bb83a631 |
hex | 77dd9bb5 |
2011012021 has 2 divisors, whose sum is σ = 2011012022. Its totient is φ = 2011012020.
The previous prime is 2011012009. The next prime is 2011012043. The reversal of 2011012021 is 1202101102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2010535921 + 476100 = 44839^2 + 690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011012021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011011989 and 2011012007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011012001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005506010 + 1005506011.
It is an arithmetic number, because the mean of its divisors is an integer number (1005506011).
Almost surely, 22011012021 is an apocalyptic number.
It is an amenable number.
2011012021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011012021 is an equidigital number, since it uses as much as digits as its factorization.
2011012021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2011012021 is about 44844.3086801436. The cubic root of 2011012021 is about 1262.2291983440.
Adding to 2011012021 its reverse (1202101102), we get a palindrome (3213113123).
It can be divided in two parts, 20110 and 12021, that added together give a triangular number (32131 = T253).
The spelling of 2011012021 in words is "two billion, eleven million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •