Base | Representation |
---|---|
bin | 11110100100110011010… |
… | …100011101110111111001 |
3 | 21102212022021100112121222 |
4 | 132210303110131313321 |
5 | 233411023100323001 |
6 | 4245122041041425 |
7 | 304541134263515 |
oct | 36446324356771 |
9 | 7385267315558 |
10 | 2101100011001 |
11 | 7400871a9492 |
12 | 29b25a186275 |
13 | 123195c297a4 |
14 | 7399da53145 |
15 | 399c3aa161b |
hex | 1e93351ddf9 |
2101100011001 has 2 divisors, whose sum is σ = 2101100011002. Its totient is φ = 2101100011000.
The previous prime is 2101100010923. The next prime is 2101100011013. The reversal of 2101100011001 is 1001100011012.
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., 1535108610025 + 565991400976 = 1238995^2 + 752324^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101100011001 - 230 = 2100026269177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2101100011001.
It is not a weakly prime, because it can be changed into another prime (2101100011201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050550005500 + 1050550005501.
It is an arithmetic number, because the mean of its divisors is an integer number (1050550005501).
Almost surely, 22101100011001 is an apocalyptic number.
It is an amenable number.
2101100011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101100011001 is an equidigital number, since it uses as much as digits as its factorization.
2101100011001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 2101100011001 its reverse (1001100011012), we get a palindrome (3102200022013).
The spelling of 2101100011001 in words is "two trillion, one hundred one billion, one hundred million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •