Base | Representation |
---|---|
bin | 110000000000000011100001… |
… | …010001111100010100100001 |
3 | 1000200110220211201110222012121 |
4 | 300000003201101330110201 |
5 | 210132311301100010423 |
6 | 2024554333430224241 |
7 | 62316123621150064 |
oct | 6000034121742441 |
9 | 1020426751428177 |
10 | 211110012110113 |
11 | 612a2287233926 |
12 | 1b81664bab5081 |
13 | 90a478655cc7c |
14 | 3a1bac9c128db |
15 | 19616c893445d |
hex | c000e147c521 |
211110012110113 has 2 divisors, whose sum is σ = 211110012110114. Its totient is φ = 211110012110112.
The previous prime is 211110012110111. The next prime is 211110012110167. The reversal of 211110012110113 is 311011210011112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 193203133461009 + 17906878649104 = 13899753^2 + 4231652^2 .
It is a cyclic number.
It is not a de Polignac number, because 211110012110113 - 21 = 211110012110111 is a prime.
Together with 211110012110111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (211110012110111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105555006055056 + 105555006055057.
It is an arithmetic number, because the mean of its divisors is an integer number (105555006055057).
Almost surely, 2211110012110113 is an apocalyptic number.
It is an amenable number.
211110012110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
211110012110113 is an equidigital number, since it uses as much as digits as its factorization.
211110012110113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 211110012110113 its reverse (311011210011112), we get a palindrome (522121222121225).
The spelling of 211110012110113 in words is "two hundred eleven trillion, one hundred ten billion, twelve million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •