Base | Representation |
---|---|
bin | 1100010010110111000… |
… | …0010000101001001111 |
3 | 202012012100121201201101 |
4 | 3010231300100221033 |
5 | 11430040040221221 |
6 | 241011131323531 |
7 | 21155153034454 |
oct | 3045560205117 |
9 | 665170551641 |
10 | 211221023311 |
11 | 8163a841091 |
12 | 34b295b05a7 |
13 | 16bc1c81c3c |
14 | a31a48782b |
15 | 5763621d91 |
hex | 312dc10a4f |
211221023311 has 8 divisors (see below), whose sum is σ = 211705223840. Its totient is φ = 210736919808.
The previous prime is 211221023291. The next prime is 211221023399. The reversal of 211221023311 is 113320122112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211221023311 - 213 = 211221015119 is a prime.
It is a super-2 number, since 2×2112210233112 (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 (211221023911) 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 7 ways as a sum of consecutive naturals, for example, 6059350 + ... + 6094108.
It is an arithmetic number, because the mean of its divisors is an integer number (26463152980).
Almost surely, 2211221023311 is an apocalyptic number.
211221023311 is a deficient number, since it is larger than the sum of its proper divisors (484200529).
211221023311 is a wasteful number, since it uses less digits than its factorization.
211221023311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48513.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 211221023311 its reverse (113320122112), we get a palindrome (324541145423).
The spelling of 211221023311 in words is "two hundred eleven billion, two hundred twenty-one million, twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •