Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …110011001001100110010001 |
3 | 222100200102011222220210020202 |
4 | 231230323312303021212101 |
5 | 202321141020122401001 |
6 | 1551254045015144545 |
7 | 60223525606151342 |
oct | 5554736663114621 |
9 | 870612158823222 |
10 | 201000020122001 |
11 | 590546a23321a1 |
12 | 1a663198075155 |
13 | 88202b3781519 |
14 | 378c64a9c80c9 |
15 | 183871247c96b |
hex | b6cef6cc9991 |
201000020122001 has 2 divisors, whose sum is σ = 201000020122002. Its totient is φ = 201000020122000.
The previous prime is 201000020121959. The next prime is 201000020122003. The reversal of 201000020122001 is 100221020000102.
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., 113652677961601 + 87347342160400 = 10660801^2 + 9345980^2 .
It is a cyclic number.
It is not a de Polignac number, because 201000020122001 - 214 = 201000020105617 is a prime.
Together with 201000020122003, 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 (201000020122003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500010061000 + 100500010061001.
It is an arithmetic number, because the mean of its divisors is an integer number (100500010061001).
Almost surely, 2201000020122001 is an apocalyptic number.
It is an amenable number.
201000020122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000020122001 is an equidigital number, since it uses as much as digits as its factorization.
201000020122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201000020122001 its reverse (100221020000102), we get a palindrome (301221040122103).
The spelling of 201000020122001 in words is "two hundred one trillion, twenty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •