Base | Representation |
---|---|
bin | 1011101101001010000… |
… | …0000101011110010001 |
3 | 201020002000100200011201 |
4 | 2323102200011132101 |
5 | 11243323112401001 |
6 | 232214545311201 |
7 | 20346306555532 |
oct | 2732240053621 |
9 | 636060320151 |
10 | 201100122001 |
11 | 7831685a139 |
12 | 32b84035501 |
13 | 15c6b21353c |
14 | 9a3a252689 |
15 | 536ed31501 |
hex | 2ed2805791 |
201100122001 has 2 divisors, whose sum is σ = 201100122002. Its totient is φ = 201100122000.
The previous prime is 201100121983. The next prime is 201100122121. The reversal of 201100122001 is 100221001102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 169566886225 + 31533235776 = 411785^2 + 177576^2 .
It is a cyclic number.
It is not a de Polignac number, because 201100122001 - 25 = 201100121969 is a prime.
It is not a weakly prime, because it can be changed into another prime (201100128001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100550061000 + 100550061001.
It is an arithmetic number, because the mean of its divisors is an integer number (100550061001).
Almost surely, 2201100122001 is an apocalyptic number.
It is an amenable number.
201100122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201100122001 is an equidigital number, since it uses as much as digits as its factorization.
201100122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 201100122001 its reverse (100221001102), we get a palindrome (301321123103).
The spelling of 201100122001 in words is "two hundred one billion, one hundred million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •