Base | Representation |
---|---|
bin | 10011010000101… |
… | …110000100110011 |
3 | 211112001201122101 |
4 | 103100232010303 |
5 | 1130211301011 |
6 | 52022121231 |
7 | 11002505443 |
oct | 2320560463 |
9 | 745051571 |
10 | 323150131 |
11 | 156456527 |
12 | 90280217 |
13 | 51c44cc5 |
14 | 30cbc123 |
15 | 1d5832c1 |
hex | 1342e133 |
323150131 has 2 divisors, whose sum is σ = 323150132. Its totient is φ = 323150130.
The previous prime is 323150099. The next prime is 323150143. The reversal of 323150131 is 131051323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323150131 - 25 = 323150099 is a prime.
It is a super-2 number, since 2×3231501312 = 208852014330634322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 323150099 and 323150108.
It is not a weakly prime, because it can be changed into another prime (323150171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161575065 + 161575066.
It is an arithmetic number, because the mean of its divisors is an integer number (161575066).
Almost surely, 2323150131 is an apocalyptic number.
323150131 is a deficient number, since it is larger than the sum of its proper divisors (1).
323150131 is an equidigital number, since it uses as much as digits as its factorization.
323150131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 323150131 is about 17976.3770265312. The cubic root of 323150131 is about 686.2274905883.
The spelling of 323150131 in words is "three hundred twenty-three million, one hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •