Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …010111001110000000001 |
3 | 21002022012011202122001122 |
4 | 131013222322321300001 |
5 | 230241223340231311 |
6 | 4131143153242025 |
7 | 264401102501144 |
oct | 35075272716001 |
9 | 7068164678048 |
10 | 2001101102081 |
11 | 701731449104 |
12 | 2839b0863315 |
13 | 11691a70c873 |
14 | 6cbd4bd805b |
15 | 370be9d00db |
hex | 1d1eaeb9c01 |
2001101102081 has 2 divisors, whose sum is σ = 2001101102082. Its totient is φ = 2001101102080.
The previous prime is 2001101101949. The next prime is 2001101102083. The reversal of 2001101102081 is 1802011011002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1223910753025 + 777190349056 = 1106305^2 + 881584^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001101102081 - 210 = 2001101101057 is a prime.
It is a super-2 number, since 2×20011011020812 (a number of 25 digits) contains 22 as substring.
Together with 2001101102083, 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 (2001101102083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000550551040 + 1000550551041.
It is an arithmetic number, because the mean of its divisors is an integer number (1000550551041).
Almost surely, 22001101102081 is an apocalyptic number.
It is an amenable number.
2001101102081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001101102081 is an equidigital number, since it uses as much as digits as its factorization.
2001101102081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 2001101102081 its reverse (1802011011002), we get a palindrome (3803112113083).
The spelling of 2001101102081 in words is "two trillion, one billion, one hundred one million, one hundred two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •