Base | Representation |
---|---|
bin | 1100010011010001101… |
… | …1110110010111101001 |
3 | 202012111011112111022020 |
4 | 3010310123312113221 |
5 | 11430302234111241 |
6 | 241030214015053 |
7 | 21161013552501 |
oct | 3046433662751 |
9 | 665434474266 |
10 | 211333113321 |
11 | 8169803aa60 |
12 | 34b5b047489 |
13 | 16c0c2696a5 |
14 | a32b304a01 |
15 | 576d3b3b66 |
hex | 31346f65e9 |
211333113321 has 8 divisors (see below), whose sum is σ = 307393619424. Its totient is φ = 128080674720.
The previous prime is 211333113311. The next prime is 211333113331. The reversal of 211333113321 is 123311333112.
It is an interprime number because it is at equal distance from previous prime (211333113311) and next prime (211333113331).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211333113321 - 27 = 211333113193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211333113291 and 211333113300.
It is not an unprimeable number, because it can be changed into a prime (211333113301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3202016836 + ... + 3202016901.
It is an arithmetic number, because the mean of its divisors is an integer number (38424202428).
Almost surely, 2211333113321 is an apocalyptic number.
It is an amenable number.
211333113321 is a deficient number, since it is larger than the sum of its proper divisors (96060506103).
211333113321 is a wasteful number, since it uses less digits than its factorization.
211333113321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6404033751.
The product of its digits is 972, while the sum is 24.
Adding to 211333113321 its reverse (123311333112), we get a palindrome (334644446433).
The spelling of 211333113321 in words is "two hundred eleven billion, three hundred thirty-three million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •