Base | Representation |
---|---|
bin | 11110101101010010111… |
… | …011001110110000111101 |
3 | 21110201211212121012100112 |
4 | 132231102323032300331 |
5 | 234033212332413041 |
6 | 4253231034235405 |
7 | 305313136520012 |
oct | 36552273166075 |
9 | 7421755535315 |
10 | 2110220201021 |
11 | 743a37321209 |
12 | 2a0b84585b65 |
13 | 123cba56c32a |
14 | 741c6dd3709 |
15 | 39d595bedeb |
hex | 1eb52ecec3d |
2110220201021 has 2 divisors, whose sum is σ = 2110220201022. Its totient is φ = 2110220201020.
The previous prime is 2110220200999. The next prime is 2110220201027. The reversal of 2110220201021 is 1201020220112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2098412988100 + 11807212921 = 1448590^2 + 108661^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110220201021 - 230 = 2109146459197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2110220200987 and 2110220201005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110220201027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055110100510 + 1055110100511.
It is an arithmetic number, because the mean of its divisors is an integer number (1055110100511).
Almost surely, 22110220201021 is an apocalyptic number.
It is an amenable number.
2110220201021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110220201021 is an equidigital number, since it uses as much as digits as its factorization.
2110220201021 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 14.
Adding to 2110220201021 its reverse (1201020220112), we get a palindrome (3311240421133).
The spelling of 2110220201021 in words is "two trillion, one hundred ten billion, two hundred twenty million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •