Base | Representation |
---|---|
bin | 1100010011001110101… |
… | …0010000011111011101 |
3 | 202012110021002000101012 |
4 | 3010303222100133131 |
5 | 11430240422104432 |
6 | 241025031225005 |
7 | 21160465216151 |
oct | 3046352203735 |
9 | 665407060335 |
10 | 211320113117 |
11 | 81690770793 |
12 | 34b56818165 |
13 | 16c09667369 |
14 | a3296bd061 |
15 | 576c196cb2 |
hex | 3133a907dd |
211320113117 has 2 divisors, whose sum is σ = 211320113118. Its totient is φ = 211320113116.
The previous prime is 211320113111. The next prime is 211320113119. The reversal of 211320113117 is 711311023112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 155479587481 + 55840525636 = 394309^2 + 236306^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211320113117 is a prime.
Together with 211320113119, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 211320113092 and 211320113101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211320113111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105660056558 + 105660056559.
It is an arithmetic number, because the mean of its divisors is an integer number (105660056559).
Almost surely, 2211320113117 is an apocalyptic number.
It is an amenable number.
211320113117 is a deficient number, since it is larger than the sum of its proper divisors (1).
211320113117 is an equidigital number, since it uses as much as digits as its factorization.
211320113117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 211320113117 its reverse (711311023112), we get a palindrome (922631136229).
The spelling of 211320113117 in words is "two hundred eleven billion, three hundred twenty million, one hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •