Base | Representation |
---|---|
bin | 110000000000000101011000… |
… | …011110111011001100101101 |
3 | 1000200111010000002122000020221 |
4 | 300000011120132323030231 |
5 | 210132324400033031333 |
6 | 2024555304111011341 |
7 | 62316224314021666 |
oct | 6000053036731455 |
9 | 1020433002560227 |
10 | 211112012002093 |
11 | 612a3113107314 |
12 | 1b816b09809b51 |
13 | 90a4a1499a0c7 |
14 | 3a1bc3968036d |
15 | 19617942c4d2d |
hex | c001587bb32d |
211112012002093 has 2 divisors, whose sum is σ = 211112012002094. Its totient is φ = 211112012002092.
The previous prime is 211112012002091. The next prime is 211112012002117. The reversal of 211112012002093 is 390200210211112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 210468658821444 + 643353180649 = 14507538^2 + 802093^2 .
It is a cyclic number.
It is not a de Polignac number, because 211112012002093 - 21 = 211112012002091 is a prime.
It is a super-2 number, since 2×2111120120020932 (a number of 29 digits) contains 22 as substring.
Together with 211112012002091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211112012002091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105556006001046 + 105556006001047.
It is an arithmetic number, because the mean of its divisors is an integer number (105556006001047).
Almost surely, 2211112012002093 is an apocalyptic number.
It is an amenable number.
211112012002093 is a deficient number, since it is larger than the sum of its proper divisors (1).
211112012002093 is an equidigital number, since it uses as much as digits as its factorization.
211112012002093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 211112012002093 in words is "two hundred eleven trillion, one hundred twelve billion, twelve million, two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •