Base | Representation |
---|---|
bin | 100100101111101011011011… |
… | …0001010011101111000100011 |
3 | 1120101101210021001002200021111 |
4 | 1021133112312022131320203 |
5 | 314331002121402414133 |
6 | 3103225352042004151 |
7 | 125036212240164352 |
oct | 11137266612357043 |
9 | 1511353231080244 |
10 | 323212230123043 |
11 | 93a9259a862938 |
12 | 30300841aa6657 |
13 | 10b46a232726c1 |
14 | 59b57ac06d999 |
15 | 2757759e381cd |
hex | 125f5b629de23 |
323212230123043 has 2 divisors, whose sum is σ = 323212230123044. Its totient is φ = 323212230123042.
The previous prime is 323212230123007. The next prime is 323212230123059. The reversal of 323212230123043 is 340321032212323.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323212230123043 is a prime.
It is a super-2 number, since 2×3232122301230432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323212230122996 and 323212230123014.
It is not a weakly prime, because it can be changed into another prime (323212230123943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161606115061521 + 161606115061522.
It is an arithmetic number, because the mean of its divisors is an integer number (161606115061522).
Almost surely, 2323212230123043 is an apocalyptic number.
323212230123043 is a deficient number, since it is larger than the sum of its proper divisors (1).
323212230123043 is an equidigital number, since it uses as much as digits as its factorization.
323212230123043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 323212230123043 its reverse (340321032212323), we get a palindrome (663533262335366).
The spelling of 323212230123043 in words is "three hundred twenty-three trillion, two hundred twelve billion, two hundred thirty million, one hundred twenty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •