Base | Representation |
---|---|
bin | 101101101110011001111001… |
… | …101011001100100010100001 |
3 | 222101001001211110120011120221 |
4 | 231232121321223030202201 |
5 | 202324314322011200001 |
6 | 1551412305110403041 |
7 | 60234032152620511 |
oct | 5556317153144241 |
9 | 871031743504527 |
10 | 201101000100001 |
11 | 59093500956271 |
12 | 1a67a87a060481 |
13 | 882998730a9b1 |
14 | 37934a9c63841 |
15 | 183b1727411a1 |
hex | b6e679acc8a1 |
201101000100001 has 2 divisors, whose sum is σ = 201101000100002. Its totient is φ = 201101000100000.
The previous prime is 201101000099917. The next prime is 201101000100031. The reversal of 201101000100001 is 100001000101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186925662149776 + 14175337950225 = 13672076^2 + 3765015^2 .
It is a cyclic number.
It is not a de Polignac number, because 201101000100001 - 27 = 201101000099873 is a prime.
It is a super-2 number, since 2×2011010001000012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201101000100031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550500050000 + 100550500050001.
It is an arithmetic number, because the mean of its divisors is an integer number (100550500050001).
Almost surely, 2201101000100001 is an apocalyptic number.
It is an amenable number.
201101000100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201101000100001 is an equidigital number, since it uses as much as digits as its factorization.
201101000100001 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 201101000100001 its reverse (100001000101102), we get a palindrome (301102000201103).
The spelling of 201101000100001 in words is "two hundred one trillion, one hundred one billion, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •