Base | Representation |
---|---|
bin | 1100010010100011111… |
… | …1110011111110010101 |
3 | 202011222210110000001201 |
4 | 3010220333303332111 |
5 | 11424404122322401 |
6 | 240555200552501 |
7 | 21153163464526 |
oct | 3045077637625 |
9 | 664883400051 |
10 | 211141214101 |
11 | 815a9790264 |
12 | 34b06922731 |
13 | 16bab58a65c |
14 | a30da3084d |
15 | 575b609b01 |
hex | 3128ff3f95 |
211141214101 has 16 divisors (see below), whose sum is σ = 232742586240. Its totient is φ = 190650620160.
The previous prime is 211141214093. The next prime is 211141214111. The reversal of 211141214101 is 101412141112.
It is a cyclic number.
It is not a de Polignac number, because 211141214101 - 23 = 211141214093 is a prime.
It is a super-2 number, since 2×2111412141012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211141214111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 736920 + ... + 982513.
It is an arithmetic number, because the mean of its divisors is an integer number (14546411640).
Almost surely, 2211141214101 is an apocalyptic number.
It is an amenable number.
211141214101 is a deficient number, since it is larger than the sum of its proper divisors (21601372139).
211141214101 is a wasteful number, since it uses less digits than its factorization.
211141214101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1719756.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 211141214101 its reverse (101412141112), we get a palindrome (312553355213).
The spelling of 211141214101 in words is "two hundred eleven billion, one hundred forty-one million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •