Base | Representation |
---|---|
bin | 10010101000101111… |
… | …111100101110111001 |
3 | 1220122121020200111121 |
4 | 102220233330232321 |
5 | 311440304323001 |
6 | 13105401225241 |
7 | 1305614533642 |
oct | 225057745671 |
9 | 56577220447 |
10 | 20011011001 |
11 | 853976a823 |
12 | 3a65792221 |
13 | 1b6ba61717 |
14 | d7b9506c9 |
15 | 7c1be36a1 |
hex | 4a8bfcbb9 |
20011011001 has 2 divisors, whose sum is σ = 20011011002. Its totient is φ = 20011011000.
The previous prime is 20011010989. The next prime is 20011011073. The reversal of 20011011001 is 10011011002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18892777401 + 1118233600 = 137451^2 + 33440^2 .
It is a cyclic number.
It is not a de Polignac number, because 20011011001 - 215 = 20010978233 is a prime.
It is a super-2 number, since 2×200110110012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20011015001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005505500 + 10005505501.
It is an arithmetic number, because the mean of its divisors is an integer number (10005505501).
Almost surely, 220011011001 is an apocalyptic number.
It is an amenable number.
20011011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011011001 is an equidigital number, since it uses as much as digits as its factorization.
20011011001 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 7.
Adding to 20011011001 its reverse (10011011002), we get a palindrome (30022022003).
Subtracting from 20011011001 its reverse (10011011002), we obtain a palindrome (9999999999).
The spelling of 20011011001 in words is "twenty billion, eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •