Base | Representation |
---|---|
bin | 1001010101111101111… |
… | …00100101101100110101 |
3 | 1010200122012201022221012 |
4 | 10222332330211230311 |
5 | 20224432432242010 |
6 | 403251335202005 |
7 | 32123310421001 |
oct | 4527674455465 |
9 | 1120565638835 |
10 | 321031134005 |
11 | 11416a78458a |
12 | 52274816305 |
13 | 243720248ba |
14 | 1177635b701 |
15 | 853dc0b005 |
hex | 4abef25b35 |
321031134005 has 8 divisors (see below), whose sum is σ = 387192881592. Its totient is φ = 255521226688.
The previous prime is 321031133959. The next prime is 321031134029. The reversal of 321031134005 is 500431130123.
It can be written as a sum of positive squares in 4 ways, for example, as 91788397156 + 229242736849 = 302966^2 + 478793^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 321031134005 - 214 = 321031117621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 162958982 + ... + 162960951.
It is an arithmetic number, because the mean of its divisors is an integer number (48399110199).
Almost surely, 2321031134005 is an apocalyptic number.
It is an amenable number.
321031134005 is a deficient number, since it is larger than the sum of its proper divisors (66161747587).
321031134005 is a wasteful number, since it uses less digits than its factorization.
321031134005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325920135.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 321031134005 its reverse (500431130123), we get a palindrome (821462264128).
The spelling of 321031134005 in words is "three hundred twenty-one billion, thirty-one million, one hundred thirty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •