Base | Representation |
---|---|
bin | 11001010000000… |
… | …01101011011111 |
3 | 112202120112100201 |
4 | 30220001223133 |
5 | 413211203411 |
6 | 33004004331 |
7 | 5151301531 |
oct | 1450015337 |
9 | 482515321 |
10 | 211819231 |
11 | a9625a18 |
12 | 5ab306a7 |
13 | 34b64c30 |
14 | 201bb851 |
15 | 138e13c1 |
hex | ca01adf |
211819231 has 4 divisors (see below), whose sum is σ = 228113032. Its totient is φ = 195525432.
The previous prime is 211819229. The next prime is 211819261. The reversal of 211819231 is 132918112.
211819231 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 not a de Polignac number, because 211819231 - 21 = 211819229 is a prime.
It is a super-2 number, since 2×2118192312 = 89734773242862722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 211819231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211819211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8146881 + ... + 8146906.
It is an arithmetic number, because the mean of its divisors is an integer number (57028258).
Almost surely, 2211819231 is an apocalyptic number.
211819231 is a deficient number, since it is larger than the sum of its proper divisors (16293801).
211819231 is a wasteful number, since it uses less digits than its factorization.
211819231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16293800.
The product of its digits is 864, while the sum is 28.
The square root of 211819231 is about 14554.0108217632. The cubic root of 211819231 is about 596.1036700509.
The spelling of 211819231 in words is "two hundred eleven million, eight hundred nineteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •