Base | Representation |
---|---|
bin | 111011111011101… |
… | …0110110011000001 |
3 | 12012011001101101112 |
4 | 1313313112303001 |
5 | 13104304000001 |
6 | 531314413105 |
7 | 100556134523 |
oct | 16767266301 |
9 | 5164041345 |
10 | 2011000001 |
11 | 94218007a |
12 | 481591195 |
13 | 26082913a |
14 | 15111da13 |
15 | bb836cbb |
hex | 77dd6cc1 |
2011000001 has 2 divisors, whose sum is σ = 2011000002. Its totient is φ = 2011000000.
The previous prime is 2010999979. The next prime is 2011000003. The reversal of 2011000001 is 1000001102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2009190976 + 1809025 = 44824^2 + 1345^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011000001 - 218 = 2010737857 is a prime.
Together with 2011000003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2011000003) 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 as a sum of consecutive naturals, namely, 1005500000 + 1005500001.
It is an arithmetic number, because the mean of its divisors is an integer number (1005500001).
Almost surely, 22011000001 is an apocalyptic number.
It is an amenable number.
2011000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011000001 is an equidigital number, since it uses as much as digits as its factorization.
2011000001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 5.
The square root of 2011000001 is about 44844.1746607070. The cubic root of 2011000001 is about 1262.2266835198.
Adding to 2011000001 its reverse (1000001102), we get a palindrome (3011001103).
The spelling of 2011000001 in words is "two billion, eleven million, one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •