Base | Representation |
---|---|
bin | 100110110001010101100101… |
… | …1001011110010101110101101 |
3 | 1122201111101020110120102011102 |
4 | 1031202223023023302232231 |
5 | 324144433324414300323 |
6 | 3205152042300332445 |
7 | 131555530561605062 |
oct | 11542531313625655 |
9 | 1581441213512142 |
10 | 341032402103213 |
11 | 99733036322187 |
12 | 322ba445544125 |
13 | 1183a2a9ba4242 |
14 | 60300b080cc69 |
15 | 296607e75a328 |
hex | 1362acb2f2bad |
341032402103213 has 2 divisors, whose sum is σ = 341032402103214. Its totient is φ = 341032402103212.
The previous prime is 341032402103167. The next prime is 341032402103221. The reversal of 341032402103213 is 312301204230143.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 269827208310724 + 71205193792489 = 16426418^2 + 8438317^2 .
It is a cyclic number.
It is not a de Polignac number, because 341032402103213 - 212 = 341032402099117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (341032402109213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 170516201051606 + 170516201051607.
It is an arithmetic number, because the mean of its divisors is an integer number (170516201051607).
Almost surely, 2341032402103213 is an apocalyptic number.
It is an amenable number.
341032402103213 is a deficient number, since it is larger than the sum of its proper divisors (1).
341032402103213 is an equidigital number, since it uses as much as digits as its factorization.
341032402103213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 341032402103213 its reverse (312301204230143), we get a palindrome (653333606333356).
The spelling of 341032402103213 in words is "three hundred forty-one trillion, thirty-two billion, four hundred two million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •