Base | Representation |
---|---|
bin | 10011010000011100000… |
… | …001111100001111100101 |
3 | 11200111201110102021001112 |
4 | 103100130001330033211 |
5 | 133140124432314432 |
6 | 2451531440234405 |
7 | 164415052043231 |
oct | 23203401741745 |
9 | 4614643367045 |
10 | 1323320198117 |
11 | 4702428311a5 |
12 | 19457530ba05 |
13 | 97a33606a38 |
14 | 480987c75c1 |
15 | 246513d37b2 |
hex | 1341c07c3e5 |
1323320198117 has 2 divisors, whose sum is σ = 1323320198118. Its totient is φ = 1323320198116.
The previous prime is 1323320198087. The next prime is 1323320198153. The reversal of 1323320198117 is 7118910233231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 828198282916 + 495121915201 = 910054^2 + 703649^2 .
It is a cyclic number.
It is not a de Polignac number, because 1323320198117 - 216 = 1323320132581 is a prime.
It is a super-2 number, since 2×13233201981172 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323320198197) 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, 661660099058 + 661660099059.
It is an arithmetic number, because the mean of its divisors is an integer number (661660099059).
Almost surely, 21323320198117 is an apocalyptic number.
It is an amenable number.
1323320198117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323320198117 is an equidigital number, since it uses as much as digits as its factorization.
1323320198117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 41.
The spelling of 1323320198117 in words is "one trillion, three hundred twenty-three billion, three hundred twenty million, one hundred ninety-eight thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •