Base | Representation |
---|---|
bin | 10011010001001011010… |
… | …110000100010100011111 |
3 | 11200120202210002201221221 |
4 | 103101023112010110133 |
5 | 133143241141100411 |
6 | 2452142314234211 |
7 | 164443531215655 |
oct | 23211326042437 |
9 | 4616683081857 |
10 | 1324114003231 |
11 | 47060a920788 |
12 | 194757125967 |
13 | 97b2bbcacc6 |
14 | 48131dbcdd5 |
15 | 2469ae35071 |
hex | 1344b58451f |
1324114003231 has 2 divisors, whose sum is σ = 1324114003232. Its totient is φ = 1324114003230.
The previous prime is 1324114003217. The next prime is 1324114003241. The reversal of 1324114003231 is 1323004114231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1324114003231 - 219 = 1324113478943 is a prime.
It is a super-2 number, since 2×13241140032312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1324114003196 and 1324114003205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1324114003241) 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, 662057001615 + 662057001616.
It is an arithmetic number, because the mean of its divisors is an integer number (662057001616).
Almost surely, 21324114003231 is an apocalyptic number.
1324114003231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1324114003231 is an equidigital number, since it uses as much as digits as its factorization.
1324114003231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1324114003231 its reverse (1323004114231), we get a palindrome (2647118117462).
The spelling of 1324114003231 in words is "one trillion, three hundred twenty-four billion, one hundred fourteen million, three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •