Base | Representation |
---|---|
bin | 100100101111101011011010… |
… | …1101111110000011011101011 |
3 | 1120101101210020112220221110102 |
4 | 1021133112311233300123223 |
5 | 314331002113104334011 |
6 | 3103225351231540015 |
7 | 125036212123522541 |
oct | 11137266557603353 |
9 | 1511353215827412 |
10 | 323212223121131 |
11 | 93a92596910233 |
12 | 3030083b68a60b |
13 | 10b46a21990666 |
14 | 59b57ab169d91 |
15 | 275775950373b |
hex | 125f5b5bf06eb |
323212223121131 has 2 divisors, whose sum is σ = 323212223121132. Its totient is φ = 323212223121130.
The previous prime is 323212223121127. The next prime is 323212223121143. The reversal of 323212223121131 is 131121322212323.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 323212223121131 - 22 = 323212223121127 is a prime.
It is a super-2 number, since 2×3232122231211312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323212223121094 and 323212223121103.
It is not a weakly prime, because it can be changed into another prime (323212223121181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606111560565 + 161606111560566.
It is an arithmetic number, because the mean of its divisors is an integer number (161606111560566).
Almost surely, 2323212223121131 is an apocalyptic number.
323212223121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323212223121131 is an equidigital number, since it uses as much as digits as its factorization.
323212223121131 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184, while the sum is 29.
Adding to 323212223121131 its reverse (131121322212323), we get a palindrome (454333545333454).
The spelling of 323212223121131 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred twenty-three million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •