Base | Representation |
---|---|
bin | 10011010000001010110… |
… | …110111100100110010001 |
3 | 11200110222101022112021121 |
4 | 103100022312330212101 |
5 | 133134032204301223 |
6 | 2451443105322241 |
7 | 164404653216544 |
oct | 23201266744621 |
9 | 4613871275247 |
10 | 1323032103313 |
11 | 470105149318 |
12 | 1944b4936381 |
13 | 979b8a16a3b |
14 | 4806c43285b |
15 | 24635e7715d |
hex | 1340adbc991 |
1323032103313 has 2 divisors, whose sum is σ = 1323032103314. Its totient is φ = 1323032103312.
The previous prime is 1323032103311. The next prime is 1323032103353. The reversal of 1323032103313 is 3133012303231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1158514253649 + 164517849664 = 1076343^2 + 405608^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323032103313 - 21 = 1323032103311 is a prime.
Together with 1323032103311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1323032103311) 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, 661516051656 + 661516051657.
It is an arithmetic number, because the mean of its divisors is an integer number (661516051657).
Almost surely, 21323032103313 is an apocalyptic number.
It is an amenable number.
1323032103313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323032103313 is an equidigital number, since it uses as much as digits as its factorization.
1323032103313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 1323032103313 its reverse (3133012303231), we get a palindrome (4456044406544).
The spelling of 1323032103313 in words is "one trillion, three hundred twenty-three billion, thirty-two million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •