Base | Representation |
---|---|
bin | 110000101000110101111010… |
… | …100111100010010000000101 |
3 | 1001001101212121000212100111112 |
4 | 300220311322213202100011 |
5 | 211014222111230032131 |
6 | 2034542121533214405 |
7 | 63025461105532466 |
oct | 6050657247422005 |
9 | 1031355530770445 |
10 | 213912903361541 |
11 | 62182a5328239a |
12 | 1bba9906631405 |
13 | 9248b91a6a667 |
14 | 3ab7622a02d6d |
15 | 19ae57396602b |
hex | c28d7a9e2405 |
213912903361541 has 2 divisors, whose sum is σ = 213912903361542. Its totient is φ = 213912903361540.
The previous prime is 213912903361511. The next prime is 213912903361657. The reversal of 213912903361541 is 145163309219312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 174288975441025 + 39623927920516 = 13201855^2 + 6294754^2 .
It is a cyclic number.
It is not a de Polignac number, because 213912903361541 - 214 = 213912903345157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 213912903361541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213912903361501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106956451680770 + 106956451680771.
It is an arithmetic number, because the mean of its divisors is an integer number (106956451680771).
Almost surely, 2213912903361541 is an apocalyptic number.
It is an amenable number.
213912903361541 is a deficient number, since it is larger than the sum of its proper divisors (1).
213912903361541 is an equidigital number, since it uses as much as digits as its factorization.
213912903361541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1049760, while the sum is 50.
The spelling of 213912903361541 in words is "two hundred thirteen trillion, nine hundred twelve billion, nine hundred three million, three hundred sixty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •