Base | Representation |
---|---|
bin | 1001010110001001110… |
… | …01111101111110110001 |
3 | 1010200220011211122122201 |
4 | 10223010321331332301 |
5 | 20230134031012241 |
6 | 403305310103201 |
7 | 32125633254100 |
oct | 4530471757661 |
9 | 1120804748581 |
10 | 321131110321 |
11 | 11421115a23a |
12 | 522a21aab01 |
13 | 2438995a698 |
14 | 11785744037 |
15 | 85478a8931 |
hex | 4ac4e7dfb1 |
321131110321 has 12 divisors (see below), whose sum is σ = 395534837988. Its totient is φ = 259063752192.
The previous prime is 321131110319. The next prime is 321131110331. The reversal of 321131110321 is 123011131123.
It can be written as a sum of positive squares in 2 ways, for example, as 219009960225 + 102121150096 = 467985^2 + 319564^2 .
It is not a de Polignac number, because 321131110321 - 21 = 321131110319 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (321131110331) 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 in 11 ways as a sum of consecutive naturals, for example, 192754936 + ... + 192756601.
It is an arithmetic number, because the mean of its divisors is an integer number (32961236499).
Almost surely, 2321131110321 is an apocalyptic number.
It is an amenable number.
321131110321 is a deficient number, since it is larger than the sum of its proper divisors (74403727667).
321131110321 is a wasteful number, since it uses less digits than its factorization.
321131110321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385511568 (or 385511561 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 321131110321 its reverse (123011131123), we get a palindrome (444142241444).
The spelling of 321131110321 in words is "three hundred twenty-one billion, one hundred thirty-one million, one hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •