Base | Representation |
---|---|
bin | 11110101101010011000… |
… | …010001011000110000101 |
3 | 21110201212000000122220001 |
4 | 132231103002023012011 |
5 | 234033213314132442 |
6 | 4253231141241301 |
7 | 305313161140036 |
oct | 36552302130605 |
9 | 7421760018801 |
10 | 2110222020997 |
11 | 743a38354622 |
12 | 2a0b85103231 |
13 | 123cbaa5883c |
14 | 741c7348a8d |
15 | 39d5982e2b7 |
hex | 1eb5308b185 |
2110222020997 has 2 divisors, whose sum is σ = 2110222020998. Its totient is φ = 2110222020996.
The previous prime is 2110222020979. The next prime is 2110222021001. The reversal of 2110222020997 is 7990202220112.
Together with previous prime (2110222020979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1349700238756 + 760521782241 = 1161766^2 + 872079^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110222020997 - 27 = 2110222020869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110222020097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055111010498 + 1055111010499.
It is an arithmetic number, because the mean of its divisors is an integer number (1055111010499).
Almost surely, 22110222020997 is an apocalyptic number.
It is an amenable number.
2110222020997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110222020997 is an equidigital number, since it uses as much as digits as its factorization.
2110222020997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 37.
The spelling of 2110222020997 in words is "two trillion, one hundred ten billion, two hundred twenty-two million, twenty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •