Base | Representation |
---|---|
bin | 1100010010100100010… |
… | …0010101110001010111 |
3 | 202011222212200022100001 |
4 | 3010221010111301113 |
5 | 11424404423313421 |
6 | 240555242232131 |
7 | 21153206540305 |
oct | 3045104256127 |
9 | 664885608301 |
10 | 211142401111 |
11 | 815aa421064 |
12 | 34b071b5647 |
13 | 16bab8b4a25 |
14 | a30dc5d275 |
15 | 575b791691 |
hex | 3129115c57 |
211142401111 has 8 divisors (see below), whose sum is σ = 216881244864. Its totient is φ = 205455492960.
The previous prime is 211142401037. The next prime is 211142401163. The reversal of 211142401111 is 111104241112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211142401111 - 231 = 208994917463 is a prime.
It is a super-2 number, since 2×2111424011112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211142401181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12975660 + ... + 12991921.
It is an arithmetic number, because the mean of its divisors is an integer number (27110155608).
Almost surely, 2211142401111 is an apocalyptic number.
211142401111 is a deficient number, since it is larger than the sum of its proper divisors (5738843753).
211142401111 is a wasteful number, since it uses less digits than its factorization.
211142401111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25967801.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 211142401111 its reverse (111104241112), we get a palindrome (322246642223).
The spelling of 211142401111 in words is "two hundred eleven billion, one hundred forty-two million, four hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •