Base | Representation |
---|---|
bin | 11001001101010… |
… | …00010011001101 |
3 | 112201212221011112 |
4 | 30212220103031 |
5 | 413113000013 |
6 | 32552101405 |
7 | 5145215303 |
oct | 1446502315 |
9 | 481787145 |
10 | 211453133 |
11 | a93a5961 |
12 | 5a994865 |
13 | 34a673c8 |
14 | 20124273 |
15 | 1386cba8 |
hex | c9a84cd |
211453133 has 4 divisors (see below), whose sum is σ = 213393180. Its totient is φ = 209513088.
The previous prime is 211453127. The next prime is 211453153. The reversal of 211453133 is 331354112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 161849284 + 49603849 = 12722^2 + 7043^2 .
It is a cyclic number.
It is not a de Polignac number, because 211453133 - 24 = 211453117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211453099 and 211453108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211453153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 969860 + ... + 970077.
It is an arithmetic number, because the mean of its divisors is an integer number (53348295).
Almost surely, 2211453133 is an apocalyptic number.
It is an amenable number.
211453133 is a deficient number, since it is larger than the sum of its proper divisors (1940047).
211453133 is a wasteful number, since it uses less digits than its factorization.
211453133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1940046.
The product of its digits is 1080, while the sum is 23.
The square root of 211453133 is about 14541.4281623230. The cubic root of 211453133 is about 595.7600465303.
The spelling of 211453133 in words is "two hundred eleven million, four hundred fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •