Base | Representation |
---|---|
bin | 100100101111000101110000… |
… | …0001010001001010011101101 |
3 | 1120101010001102222211000112011 |
4 | 1021132023200022021103231 |
5 | 314323140431024200323 |
6 | 3103124252302041221 |
7 | 125030316411104335 |
oct | 11136134012112355 |
9 | 1511101388730464 |
10 | 323131330303213 |
11 | 93a61255a37903 |
12 | 302a9024879211 |
13 | 10b3c1cc8a8223 |
14 | 59b18d59c40c5 |
15 | 27555c297620d |
hex | 125e2e02894ed |
323131330303213 has 2 divisors, whose sum is σ = 323131330303214. Its totient is φ = 323131330303212.
The previous prime is 323131330303169. The next prime is 323131330303253. The reversal of 323131330303213 is 312303033131323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 277690829027364 + 45440501275849 = 16664058^2 + 6740957^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-323131330303213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323131330303253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161565665151606 + 161565665151607.
It is an arithmetic number, because the mean of its divisors is an integer number (161565665151607).
Almost surely, 2323131330303213 is an apocalyptic number.
It is an amenable number.
323131330303213 is a deficient number, since it is larger than the sum of its proper divisors (1).
323131330303213 is an equidigital number, since it uses as much as digits as its factorization.
323131330303213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26244, while the sum is 31.
Adding to 323131330303213 its reverse (312303033131323), we get a palindrome (635434363434536).
The spelling of 323131330303213 in words is "three hundred twenty-three trillion, one hundred thirty-one billion, three hundred thirty million, three hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •