Base | Representation |
---|---|
bin | 1100010011010001101… |
… | …1111010111011101101 |
3 | 202012111011120102221112 |
4 | 3010310123322323231 |
5 | 11430302240211023 |
6 | 241030214241405 |
7 | 21161013661133 |
oct | 3046433727355 |
9 | 665434512845 |
10 | 211333132013 |
11 | 81698053003 |
12 | 34b5b056265 |
13 | 16c0c275053 |
14 | a32b30b753 |
15 | 576d3b9478 |
hex | 31346faeed |
211333132013 has 2 divisors, whose sum is σ = 211333132014. Its totient is φ = 211333132012.
The previous prime is 211333132009. The next prime is 211333132033. The reversal of 211333132013 is 310231333112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 202897995364 + 8435136649 = 450442^2 + 91843^2 .
It is a cyclic number.
It is not a de Polignac number, because 211333132013 - 22 = 211333132009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211333132013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211333132033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105666566006 + 105666566007.
It is an arithmetic number, because the mean of its divisors is an integer number (105666566007).
Almost surely, 2211333132013 is an apocalyptic number.
It is an amenable number.
211333132013 is a deficient number, since it is larger than the sum of its proper divisors (1).
211333132013 is an equidigital number, since it uses as much as digits as its factorization.
211333132013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 211333132013 its reverse (310231333112), we get a palindrome (521564465125).
The spelling of 211333132013 in words is "two hundred eleven billion, three hundred thirty-three million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •