Base | Representation |
---|---|
bin | 11101000111101100000… |
… | …011110010110010110101 |
3 | 21002022020111201102100002 |
4 | 131013230003302302311 |
5 | 230241243233210401 |
6 | 4131145115001045 |
7 | 264401424063515 |
oct | 35075403626265 |
9 | 7068214642302 |
10 | 2001120210101 |
11 | 70174120a261 |
12 | 2839b7139185 |
13 | 11692166cc9c |
14 | 6cbd756d845 |
15 | 370c1506a6b |
hex | 1d1ec0f2cb5 |
2001120210101 has 2 divisors, whose sum is σ = 2001120210102. Its totient is φ = 2001120210100.
The previous prime is 2001120210059. The next prime is 2001120210107. The reversal of 2001120210101 is 1010120211002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1718723622001 + 282396588100 = 1311001^2 + 531410^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001120210101 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001120210107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000560105050 + 1000560105051.
It is an arithmetic number, because the mean of its divisors is an integer number (1000560105051).
Almost surely, 22001120210101 is an apocalyptic number.
It is an amenable number.
2001120210101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001120210101 is an equidigital number, since it uses as much as digits as its factorization.
2001120210101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001120210101 its reverse (1010120211002), we get a palindrome (3011240421103).
Subtracting from 2001120210101 its reverse (1010120211002), we obtain a palindrome (990999999099).
The spelling of 2001120210101 in words is "two trillion, one billion, one hundred twenty million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •