Base | Representation |
---|---|
bin | 101101101110101101011101… |
… | …011111001010011010100001 |
3 | 222101010002001010101020200211 |
4 | 231232231131133022122201 |
5 | 202330140330004120001 |
6 | 1551430101110414121 |
7 | 60235404462163126 |
oct | 5556553537123241 |
9 | 871102033336624 |
10 | 201122002020001 |
11 | 590a13a899a647 |
12 | 1a68295b661341 |
13 | 882b9534456aa |
14 | 37944dd23674d |
15 | 183b9a141c351 |
hex | b6eb5d7ca6a1 |
201122002020001 has 2 divisors, whose sum is σ = 201122002020002. Its totient is φ = 201122002020000.
The previous prime is 201122002019999. The next prime is 201122002020061. The reversal of 201122002020001 is 100020200221102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 169696997168400 + 31425004851601 = 13026780^2 + 5605801^2 .
It is a cyclic number.
It is not a de Polignac number, because 201122002020001 - 21 = 201122002019999 is a prime.
Together with 201122002019999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (201122002020061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100561001010000 + 100561001010001.
It is an arithmetic number, because the mean of its divisors is an integer number (100561001010001).
Almost surely, 2201122002020001 is an apocalyptic number.
It is an amenable number.
201122002020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201122002020001 is an equidigital number, since it uses as much as digits as its factorization.
201122002020001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201122002020001 its reverse (100020200221102), we get a palindrome (301142202241103).
The spelling of 201122002020001 in words is "two hundred one trillion, one hundred twenty-two billion, two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •