Base | Representation |
---|---|
bin | 100100100010110011001101… |
… | …0101111000111000101101001 |
3 | 1120011010120121121220000222122 |
4 | 1021011212122233013011221 |
5 | 314113002203310103001 |
6 | 3055352310020401025 |
7 | 124464302306501114 |
oct | 11105463257070551 |
9 | 1504116547800878 |
10 | 321442243441001 |
11 | 9346a987493261 |
12 | 300757b0b46175 |
13 | 10a48b480a6447 |
14 | 5953c5d7b557b |
15 | 27266b5289b1b |
hex | 124599abc7169 |
321442243441001 has 8 divisors (see below), whose sum is σ = 336532801610880. Its totient is φ = 306618774796432.
The previous prime is 321442243440919. The next prime is 321442243441019. The reversal of 321442243441001 is 100144342244123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-321442243441001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (321442243441901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66772378865 + ... + 66772383678.
It is an arithmetic number, because the mean of its divisors is an integer number (42066600201360).
Almost surely, 2321442243441001 is an apocalyptic number.
It is an amenable number.
321442243441001 is a deficient number, since it is larger than the sum of its proper divisors (15090558169879).
321442243441001 is a wasteful number, since it uses less digits than its factorization.
321442243441001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 133544762655.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 321442243441001 its reverse (100144342244123), we get a palindrome (421586585685124).
The spelling of 321442243441001 in words is "three hundred twenty-one trillion, four hundred forty-two billion, two hundred forty-three million, four hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •