Base | Representation |
---|---|
bin | 11001001011011… |
… | …01001110000110 |
3 | 112201102122012220 |
4 | 30211231032012 |
5 | 413032224032 |
6 | 32542553210 |
7 | 5143156632 |
oct | 1445551606 |
9 | 481378186 |
10 | 211211142 |
11 | a925006a |
12 | 5a898806 |
13 | 349b120c |
14 | 2009ddc2 |
15 | 1382112c |
hex | c96d386 |
211211142 has 8 divisors (see below), whose sum is σ = 422422296. Its totient is φ = 70403712.
The previous prime is 211211123. The next prime is 211211149. The reversal of 211211142 is 241112112.
211211142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
211211142 is an admirable number.
It is a super-2 number, since 2×2112111422 = 89220293009888328, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211211149) 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, 17600923 + ... + 17600934.
It is an arithmetic number, because the mean of its divisors is an integer number (52802787).
Almost surely, 2211211142 is an apocalyptic number.
211211142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211211142 is a wasteful number, since it uses less digits than its factorization.
211211142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35201862.
The product of its digits is 32, while the sum is 15.
The square root of 211211142 is about 14533.1050364332. The cubic root of 211211142 is about 595.5326933910.
Adding to 211211142 its reverse (241112112), we get a palindrome (452323254).
The spelling of 211211142 in words is "two hundred eleven million, two hundred eleven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •