Base | Representation |
---|---|
bin | 1100001110010110010… |
… | …0100100111001110011 |
3 | 202002001221212102102121 |
4 | 3003211210210321303 |
5 | 11420100030013021 |
6 | 240251031055111 |
7 | 21113146361266 |
oct | 3034544447163 |
9 | 662057772377 |
10 | 210010001011 |
11 | 81079197108 |
12 | 3484bb11497 |
13 | 16a5b0cb7b5 |
14 | a2436c8cdd |
15 | 56e215a741 |
hex | 30e5924e73 |
210010001011 has 2 divisors, whose sum is σ = 210010001012. Its totient is φ = 210010001010.
The previous prime is 210010000999. The next prime is 210010001021. The reversal of 210010001011 is 110100010012.
210010001011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210010001011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210010000985 and 210010001003.
It is not a weakly prime, because it can be changed into another prime (210010001021) 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, 105005000505 + 105005000506.
It is an arithmetic number, because the mean of its divisors is an integer number (105005000506).
Almost surely, 2210010001011 is an apocalyptic number.
210010001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
210010001011 is an equidigital number, since it uses as much as digits as its factorization.
210010001011 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 7.
Adding to 210010001011 its reverse (110100010012), we get a palindrome (320110011023).
Subtracting from 210010001011 its reverse (110100010012), we obtain a palindrome (99909990999).
The spelling of 210010001011 in words is "two hundred ten billion, ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •