Base | Representation |
---|---|
bin | 1100010010100011111… |
… | …1110011110100111101 |
3 | 202011222210102222020111 |
4 | 3010220333303310331 |
5 | 11424404122313001 |
6 | 240555200550021 |
7 | 21153163463011 |
oct | 3045077636475 |
9 | 664883388214 |
10 | 211141213501 |
11 | 815a978a869 |
12 | 34b06922311 |
13 | 16bab58a2ba |
14 | a30da30541 |
15 | 575b609851 |
hex | 3128ff3d3d |
211141213501 has 2 divisors, whose sum is σ = 211141213502. Its totient is φ = 211141213500.
The previous prime is 211141213453. The next prime is 211141213553. The reversal of 211141213501 is 105312141112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191345004900 + 19796208601 = 437430^2 + 140699^2 .
It is a cyclic number.
It is not a de Polignac number, because 211141213501 - 223 = 211132824893 is a prime.
It is a super-2 number, since 2×2111412135012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211141213561) 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 as a sum of consecutive naturals, namely, 105570606750 + 105570606751.
It is an arithmetic number, because the mean of its divisors is an integer number (105570606751).
Almost surely, 2211141213501 is an apocalyptic number.
It is an amenable number.
211141213501 is a deficient number, since it is larger than the sum of its proper divisors (1).
211141213501 is an equidigital number, since it uses as much as digits as its factorization.
211141213501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 22.
Adding to 211141213501 its reverse (105312141112), we get a palindrome (316453354613).
The spelling of 211141213501 in words is "two hundred eleven billion, one hundred forty-one million, two hundred thirteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •