Base | Representation |
---|---|
bin | 1100011001100100111… |
… | …1011000010010101011 |
3 | 202100212000212212120022 |
4 | 3012121033120102223 |
5 | 11442233212440321 |
6 | 241510110551055 |
7 | 21250641020051 |
oct | 3063117302253 |
9 | 670760785508 |
10 | 213024343211 |
11 | 82385763009 |
12 | 3535150848b |
13 | 1711b765134 |
14 | a44bb861d1 |
15 | 581bad3dab |
hex | 31993d84ab |
213024343211 has 4 divisors (see below), whose sum is σ = 213030048000. Its totient is φ = 213018638424.
The previous prime is 213024343187. The next prime is 213024343229. The reversal of 213024343211 is 112343420312.
213024343211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-213024343211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213024340211) 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 3 ways as a sum of consecutive naturals, for example, 2796011 + ... + 2871188.
It is an arithmetic number, because the mean of its divisors is an integer number (53257512000).
Almost surely, 2213024343211 is an apocalyptic number.
213024343211 is a deficient number, since it is larger than the sum of its proper divisors (5704789).
213024343211 is an equidigital number, since it uses as much as digits as its factorization.
213024343211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5704788.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 213024343211 its reverse (112343420312), we get a palindrome (325367763523).
The spelling of 213024343211 in words is "two hundred thirteen billion, twenty-four million, three hundred forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •