Base | Representation |
---|---|
bin | 1100010011010001101… |
… | …1111010111011101011 |
3 | 202012111011120102221110 |
4 | 3010310123322323223 |
5 | 11430302240211021 |
6 | 241030214241403 |
7 | 21161013661131 |
oct | 3046433727353 |
9 | 665434512843 |
10 | 211333132011 |
11 | 81698053001 |
12 | 34b5b056263 |
13 | 16c0c275051 |
14 | a32b30b751 |
15 | 576d3b9476 |
hex | 31346faeeb |
211333132011 has 8 divisors (see below), whose sum is σ = 281994767824. Its totient is φ = 140780125440.
The previous prime is 211333132009. The next prime is 211333132013. The reversal of 211333132011 is 110231333112.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (211333132009) and next prime (211333132013).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211333132011 - 21 = 211333132009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211333132013) 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 in 7 ways as a sum of consecutive naturals, for example, 27152770 + ... + 27160551.
It is an arithmetic number, because the mean of its divisors is an integer number (35249345978).
Almost surely, 2211333132011 is an apocalyptic number.
211333132011 is a deficient number, since it is larger than the sum of its proper divisors (70661635813).
211333132011 is a wasteful number, since it uses less digits than its factorization.
211333132011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54314621.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 211333132011 its reverse (110231333112), we get a palindrome (321564465123).
The spelling of 211333132011 in words is "two hundred eleven billion, three hundred thirty-three million, one hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •