Base | Representation |
---|---|
bin | 1100010010111001101… |
… | …0010000111000000111 |
3 | 202012020010100010222012 |
4 | 3010232122100320013 |
5 | 11430100400044221 |
6 | 241012203324435 |
7 | 21155345444504 |
oct | 3045632207007 |
9 | 665203303865 |
10 | 211232034311 |
11 | 81645a81891 |
12 | 34b3122071b |
13 | 16bc4338a1c |
14 | a31bb124ab |
15 | 576459965b |
hex | 312e690e07 |
211232034311 has 4 divisors (see below), whose sum is σ = 223657448112. Its totient is φ = 198806620512.
The previous prime is 211232034281. The next prime is 211232034347. The reversal of 211232034311 is 113430232112.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211232034311 is a prime.
It is a super-3 number, since 3×2112320343113 (a number of 35 digits) contains 333 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 (211232034361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6212706875 + ... + 6212706908.
It is an arithmetic number, because the mean of its divisors is an integer number (55914362028).
Almost surely, 2211232034311 is an apocalyptic number.
211232034311 is a deficient number, since it is larger than the sum of its proper divisors (12425413801).
211232034311 is a wasteful number, since it uses less digits than its factorization.
211232034311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12425413800.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 211232034311 its reverse (113430232112), we get a palindrome (324662266423).
The spelling of 211232034311 in words is "two hundred eleven billion, two hundred thirty-two million, thirty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •