Base | Representation |
---|---|
bin | 100100100000011000101100… |
… | …1111010011001101101001011 |
3 | 1120002221212011220120112211121 |
4 | 1021000301121322121231023 |
5 | 314042033142002300021 |
6 | 3054540033510140111 |
7 | 124431315063621616 |
oct | 11100613172315513 |
9 | 1502855156515747 |
10 | 321110443400011 |
11 | 933521a0a70551 |
12 | 30021431951637 |
13 | 10a2377aca9b45 |
14 | 5941b8514117d |
15 | 271cc45e3b741 |
hex | 1240c59e99b4b |
321110443400011 has 2 divisors, whose sum is σ = 321110443400012. Its totient is φ = 321110443400010.
The previous prime is 321110443399973. The next prime is 321110443400023. The reversal of 321110443400011 is 110004344011123.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 321110443400011 - 229 = 321109906529099 is a prime.
It is a super-2 number, since 2×3211104434000112 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (321110443400041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160555221700005 + 160555221700006.
It is an arithmetic number, because the mean of its divisors is an integer number (160555221700006).
Almost surely, 2321110443400011 is an apocalyptic number.
321110443400011 is a deficient number, since it is larger than the sum of its proper divisors (1).
321110443400011 is an equidigital number, since it uses as much as digits as its factorization.
321110443400011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 321110443400011 its reverse (110004344011123), we get a palindrome (431114787411134).
The spelling of 321110443400011 in words is "three hundred twenty-one trillion, one hundred ten billion, four hundred forty-three million, four hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •