Base | Representation |
---|---|
bin | 11110101101101001001… |
… | …001000100001000000101 |
3 | 21110202210211221121012021 |
4 | 132231221021010020011 |
5 | 234034443242114323 |
6 | 4253332031123141 |
7 | 305325313603252 |
oct | 36555111041005 |
9 | 7422724847167 |
10 | 2110592926213 |
11 | 744108758162 |
12 | 2a10693734b1 |
13 | 124049851195 |
14 | 742206d8429 |
15 | 39d7c19705d |
hex | 1eb69244205 |
2110592926213 has 2 divisors, whose sum is σ = 2110592926214. Its totient is φ = 2110592926212.
The previous prime is 2110592926181. The next prime is 2110592926223. The reversal of 2110592926213 is 3126292950112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1644749820484 + 465843105729 = 1282478^2 + 682527^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110592926213 - 25 = 2110592926181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2110592926213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110592926223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055296463106 + 1055296463107.
It is an arithmetic number, because the mean of its divisors is an integer number (1055296463107).
Almost surely, 22110592926213 is an apocalyptic number.
It is an amenable number.
2110592926213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110592926213 is an equidigital number, since it uses as much as digits as its factorization.
2110592926213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 2110592926213 in words is "two trillion, one hundred ten billion, five hundred ninety-two million, nine hundred twenty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •