Base | Representation |
---|---|
bin | 11001001011100… |
… | …01110110100010 |
3 | 112201110121020120 |
4 | 30211301312202 |
5 | 413033330424 |
6 | 32543221110 |
7 | 5143266144 |
oct | 1445616642 |
9 | 481417216 |
10 | 211230114 |
11 | a9263347 |
12 | 5a8a7796 |
13 | 349b9a44 |
14 | 200a6c94 |
15 | 13826a79 |
hex | c971da2 |
211230114 has 64 divisors (see below), whose sum is σ = 464244480. Its totient is φ = 63866880.
The previous prime is 211230101. The next prime is 211230127. The reversal of 211230114 is 411032112.
211230114 is digitally balanced in base 2, 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 (211230101) and next prime (211230127).
It is a super-2 number, since 2×2112301142 = 89236322120905992, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 211230093 and 211230102.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 208842 + ... + 209850.
It is an arithmetic number, because the mean of its divisors is an integer number (7253820).
Almost surely, 2211230114 is an apocalyptic number.
211230114 is an abundant number, since it is smaller than the sum of its proper divisors (253014366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211230114 is a wasteful number, since it uses less digits than its factorization.
211230114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1115.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 211230114 is about 14533.7577384515. The cubic root of 211230114 is about 595.5505240601.
Adding to 211230114 its reverse (411032112), we get a palindrome (622262226).
The spelling of 211230114 in words is "two hundred eleven million, two hundred thirty thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •