Base | Representation |
---|---|
bin | 100100101111101011011011… |
… | …0001010011000110001110011 |
3 | 1120101101210021001001121120222 |
4 | 1021133112312022120301303 |
5 | 314331002121401232011 |
6 | 3103225352041323255 |
7 | 125036212240046366 |
oct | 11137266612306163 |
9 | 1511353231047528 |
10 | 323212230102131 |
11 | 93a9259a849157 |
12 | 30300841a9652b |
13 | 10b46a23266026 |
14 | 59b57ac0660dd |
15 | 2757759e31ddb |
hex | 125f5b6298c73 |
323212230102131 has 2 divisors, whose sum is σ = 323212230102132. Its totient is φ = 323212230102130.
The previous prime is 323212230102127. The next prime is 323212230102193. The reversal of 323212230102131 is 131201032212323.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 323212230102131 - 22 = 323212230102127 is a prime.
It is a super-2 number, since 2×3232122301021312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 323212230102131.
It is not a weakly prime, because it can be changed into another prime (323212230102731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606115051065 + 161606115051066.
It is an arithmetic number, because the mean of its divisors is an integer number (161606115051066).
Almost surely, 2323212230102131 is an apocalyptic number.
323212230102131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323212230102131 is an equidigital number, since it uses as much as digits as its factorization.
323212230102131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 323212230102131 its reverse (131201032212323), we get a palindrome (454413262314454).
The spelling of 323212230102131 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred thirty million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •