Base | Representation |
---|---|
bin | 111011111011101… |
… | …1001101110100001 |
3 | 12012011001222211222 |
4 | 1313313121232201 |
5 | 13104304341001 |
6 | 531314544425 |
7 | 100556214515 |
oct | 16767315641 |
9 | 5164058758 |
10 | 2011012001 |
11 | 942189099 |
12 | 481598115 |
13 | 26083173b |
14 | 151124145 |
15 | bb83a61b |
hex | 77dd9ba1 |
2011012001 has 2 divisors, whose sum is σ = 2011012002. Its totient is φ = 2011012000.
The previous prime is 2011011997. The next prime is 2011012009. The reversal of 2011012001 is 1002101102.
It is an a-pointer prime, because the next prime (2011012009) can be obtained adding 2011012001 to its sum of digits (8).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1478325601 + 532686400 = 38449^2 + 23080^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011012001 - 22 = 2011011997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2011012001.
It is not a weakly prime, because it can be changed into another prime (2011012009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005506000 + 1005506001.
It is an arithmetic number, because the mean of its divisors is an integer number (1005506001).
Almost surely, 22011012001 is an apocalyptic number.
It is an amenable number.
2011012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011012001 is an equidigital number, since it uses as much as digits as its factorization.
2011012001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 2011012001 is about 44844.3084571498. The cubic root of 2011012001 is about 1262.2291941596.
Adding to 2011012001 its reverse (1002101102), we get a palindrome (3013113103).
The spelling of 2011012001 in words is "two billion, eleven million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •