Base | Representation |
---|---|
bin | 1100011010010110000… |
… | …0101101010011010111 |
3 | 202101101101021002212210 |
4 | 3012211200231103113 |
5 | 11443143413243221 |
6 | 241542343244503 |
7 | 21256020620364 |
oct | 3064540552327 |
9 | 671341232783 |
10 | 213230212311 |
11 | 82480994566 |
12 | 353aa449733 |
13 | 171522c597c |
14 | a46b25546b |
15 | 582ebec276 |
hex | 31a582d4d7 |
213230212311 has 8 divisors (see below), whose sum is σ = 288967719664. Its totient is φ = 139823089920.
The previous prime is 213230212243. The next prime is 213230212313. The reversal of 213230212311 is 113212032312.
213230212311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213230212311 - 210 = 213230211287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213230212313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582596026 + ... + 582596391.
It is an arithmetic number, because the mean of its divisors is an integer number (36120964958).
Almost surely, 2213230212311 is an apocalyptic number.
213230212311 is a deficient number, since it is larger than the sum of its proper divisors (75737507353).
213230212311 is a wasteful number, since it uses less digits than its factorization.
213230212311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165192481.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 213230212311 its reverse (113212032312), we get a palindrome (326442244623).
The spelling of 213230212311 in words is "two hundred thirteen billion, two hundred thirty million, two hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •