Base | Representation |
---|---|
bin | 11001001010100… |
… | …01000101010010 |
3 | 112201012210010022 |
4 | 30211101011102 |
5 | 413020032030 |
6 | 32540303442 |
7 | 5142166625 |
oct | 1445210522 |
9 | 481183108 |
10 | 211095890 |
11 | a9181515 |
12 | 5a841b82 |
13 | 34970915 |
14 | 2006ddbc |
15 | 137ebde5 |
hex | c951152 |
211095890 has 16 divisors (see below), whose sum is σ = 399971520. Its totient is φ = 79994160.
The previous prime is 211095887. The next prime is 211095893. The reversal of 211095890 is 98590112.
211095890 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (211095887) and next prime (211095893).
It is a super-2 number, since 2×2110958902 = 89122949549784200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211095890.
It is not an unprimeable number, because it can be changed into a prime (211095893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 555326 + ... + 555705.
It is an arithmetic number, because the mean of its divisors is an integer number (24998220).
Almost surely, 2211095890 is an apocalyptic number.
211095890 is a deficient number, since it is larger than the sum of its proper divisors (188875630).
211095890 is a wasteful number, since it uses less digits than its factorization.
211095890 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111057.
The product of its (nonzero) digits is 6480, while the sum is 35.
The square root of 211095890 is about 14529.1393413375. The cubic root of 211095890 is about 595.4243518496.
The spelling of 211095890 in words is "two hundred eleven million, ninety-five thousand, eight hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •