Base | Representation |
---|---|
bin | 1100100001101110000… |
… | …1100000111001100101 |
3 | 202120111100211121101222 |
4 | 3020123201200321211 |
5 | 12011222243311031 |
6 | 242511032030125 |
7 | 21356051652221 |
oct | 3103341407145 |
9 | 676440747358 |
10 | 215210135141 |
11 | 832a7568921 |
12 | 35861532345 |
13 | 173a9560741 |
14 | a5b81a5781 |
15 | 58e8945e7b |
hex | 321b860e65 |
215210135141 has 2 divisors, whose sum is σ = 215210135142. Its totient is φ = 215210135140.
The previous prime is 215210135059. The next prime is 215210135171. The reversal of 215210135141 is 141531012512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136712104516 + 78498030625 = 369746^2 + 280175^2 .
It is a cyclic number.
It is not a de Polignac number, because 215210135141 - 214 = 215210118757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 215210135141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215210135171) 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 as a sum of consecutive naturals, namely, 107605067570 + 107605067571.
It is an arithmetic number, because the mean of its divisors is an integer number (107605067571).
Almost surely, 2215210135141 is an apocalyptic number.
It is an amenable number.
215210135141 is a deficient number, since it is larger than the sum of its proper divisors (1).
215210135141 is an equidigital number, since it uses as much as digits as its factorization.
215210135141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 215210135141 its reverse (141531012512), we get a palindrome (356741147653).
The spelling of 215210135141 in words is "two hundred fifteen billion, two hundred ten million, one hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •