Base | Representation |
---|---|
bin | 1001010110000110000… |
… | …11010010111011101001 |
3 | 1010200211000022010200200 |
4 | 10223003003102323221 |
5 | 20230103100013001 |
6 | 403302235222413 |
7 | 32125104655263 |
oct | 4530303227351 |
9 | 1120730263620 |
10 | 321100001001 |
11 | 1141a564135a |
12 | 522938a7a09 |
13 | 243833877c0 |
14 | 11781566b33 |
15 | 8544cb1086 |
hex | 4ac30d2ee9 |
321100001001 has 24 divisors (see below), whose sum is σ = 528870593160. Its totient is φ = 185976470016.
The previous prime is 321100000987. The next prime is 321100001003. The reversal of 321100001001 is 100100001123.
It can be written as a sum of positive squares in 4 ways, for example, as 23939825625 + 297160175376 = 154725^2 + 545124^2 .
It is not a de Polignac number, because 321100001001 - 26 = 321100000937 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (321100001003) 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 in 23 ways as a sum of consecutive naturals, for example, 80716966 + ... + 80720943.
It is an arithmetic number, because the mean of its divisors is an integer number (22036274715).
Almost surely, 2321100001001 is an apocalyptic number.
It is an amenable number.
321100001001 is a deficient number, since it is larger than the sum of its proper divisors (207770592159).
321100001001 is a wasteful number, since it uses less digits than its factorization.
321100001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161437945 (or 161437942 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 321100001001 its reverse (100100001123), we get a palindrome (421200002124).
The spelling of 321100001001 in words is "three hundred twenty-one billion, one hundred million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •