Base | Representation |
---|---|
bin | 10011010000011011100… |
… | …100010110001101001101 |
3 | 11200111200220211010010002 |
4 | 103100123210112031031 |
5 | 133140120441041031 |
6 | 2451531002054045 |
7 | 164414626102226 |
oct | 23203344261515 |
9 | 4614626733102 |
10 | 1323312440141 |
11 | 47023941254a |
12 | 1945727aa325 |
13 | 97a31b1b813 |
14 | 4809776824d |
15 | 2465089eccb |
hex | 1341b91634d |
1323312440141 has 2 divisors, whose sum is σ = 1323312440142. Its totient is φ = 1323312440140.
The previous prime is 1323312440089. The next prime is 1323312440147. The reversal of 1323312440141 is 1410442133231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1097159882116 + 226152558025 = 1047454^2 + 475555^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323312440141 - 222 = 1323308245837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323312440147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661656220070 + 661656220071.
It is an arithmetic number, because the mean of its divisors is an integer number (661656220071).
Almost surely, 21323312440141 is an apocalyptic number.
It is an amenable number.
1323312440141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323312440141 is an equidigital number, since it uses as much as digits as its factorization.
1323312440141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1323312440141 its reverse (1410442133231), we get a palindrome (2733754573372).
The spelling of 1323312440141 in words is "one trillion, three hundred twenty-three billion, three hundred twelve million, four hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •