Base | Representation |
---|---|
bin | 1100010011010001100… |
… | …0000110010010011101 |
3 | 202012111002200112101001 |
4 | 3010310120012102131 |
5 | 11430302011124244 |
6 | 241030140550301 |
7 | 21161002315513 |
oct | 3046430062235 |
9 | 665432615331 |
10 | 211332129949 |
11 | 81697529156 |
12 | 34b5a852391 |
13 | 16c0bcb3c05 |
14 | a32b12a4b3 |
15 | 576d26c5d4 |
hex | 313460649d |
211332129949 has 2 divisors, whose sum is σ = 211332129950. Its totient is φ = 211332129948.
The previous prime is 211332129947. The next prime is 211332129991. The reversal of 211332129949 is 949921233112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111276950724 + 100055179225 = 333582^2 + 316315^2 .
It is a cyclic number.
It is not a de Polignac number, because 211332129949 - 21 = 211332129947 is a prime.
It is a super-2 number, since 2×2113321299492 (a number of 23 digits) contains 22 as substring.
Together with 211332129947, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 211332129899 and 211332129908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211332129947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105666064974 + 105666064975.
It is an arithmetic number, because the mean of its divisors is an integer number (105666064975).
Almost surely, 2211332129949 is an apocalyptic number.
It is an amenable number.
211332129949 is a deficient number, since it is larger than the sum of its proper divisors (1).
211332129949 is an equidigital number, since it uses as much as digits as its factorization.
211332129949 is an evil number, because the sum of its binary digits is even.
The product of its digits is 209952, while the sum is 46.
The spelling of 211332129949 in words is "two hundred eleven billion, three hundred thirty-two million, one hundred twenty-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •