Base | Representation |
---|---|
bin | 1100010011001110111… |
… | …0011100110001111111 |
3 | 202012110100010211210201 |
4 | 3010303232130301333 |
5 | 11430241212241111 |
6 | 241025110544331 |
7 | 21160510444036 |
oct | 3046356346177 |
9 | 665410124721 |
10 | 211321212031 |
11 | 81691351386 |
12 | 34b570680a7 |
13 | 16c099605c7 |
14 | a3298c771d |
15 | 576c3126c1 |
hex | 3133b9cc7f |
211321212031 has 4 divisors (see below), whose sum is σ = 211423648032. Its totient is φ = 211218776032.
The previous prime is 211321212019. The next prime is 211321212073. The reversal of 211321212031 is 130212123112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 211321212031 - 25 = 211321211999 is a prime.
It is a super-2 number, since 2×2113212120312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211321212731) 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 3 ways as a sum of consecutive naturals, for example, 51214906 + ... + 51219031.
It is an arithmetic number, because the mean of its divisors is an integer number (52855912008).
Almost surely, 2211321212031 is an apocalyptic number.
211321212031 is a deficient number, since it is larger than the sum of its proper divisors (102436001).
211321212031 is a wasteful number, since it uses less digits than its factorization.
211321212031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102436000.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 211321212031 its reverse (130212123112), we get a palindrome (341533335143).
The spelling of 211321212031 in words is "two hundred eleven billion, three hundred twenty-one million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •