Base | Representation |
---|---|
bin | 1001011001111000001… |
… | …00010100110100111001 |
3 | 1010220001111200201120221 |
4 | 10230330010110310321 |
5 | 20243232330022131 |
6 | 404235524020041 |
7 | 32226320231263 |
oct | 4547404246471 |
9 | 1126044621527 |
10 | 323130314041 |
11 | 115047702617 |
12 | 5275b831621 |
13 | 24617bb6472 |
14 | 118d5072b33 |
15 | 8613160411 |
hex | 4b3c114d39 |
323130314041 has 2 divisors, whose sum is σ = 323130314042. Its totient is φ = 323130314040.
The previous prime is 323130314021. The next prime is 323130314051. The reversal of 323130314041 is 140413031323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281301883641 + 41828430400 = 530379^2 + 204520^2 .
It is an emirp because it is prime and its reverse (140413031323) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 323130314041 - 219 = 323129789753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 323130313997 and 323130314015.
It is not a weakly prime, because it can be changed into another prime (323130314021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161565157020 + 161565157021.
It is an arithmetic number, because the mean of its divisors is an integer number (161565157021).
Almost surely, 2323130314041 is an apocalyptic number.
It is an amenable number.
323130314041 is a deficient number, since it is larger than the sum of its proper divisors (1).
323130314041 is an equidigital number, since it uses as much as digits as its factorization.
323130314041 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 25.
Adding to 323130314041 its reverse (140413031323), we get a palindrome (463543345364).
The spelling of 323130314041 in words is "three hundred twenty-three billion, one hundred thirty million, three hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •