Base | Representation |
---|---|
bin | 1001011100001000011… |
… | …00011111001110010101 |
3 | 1011000011211201010202020 |
4 | 10232010030133032111 |
5 | 20303222121211313 |
6 | 404555552403353 |
7 | 32301313011456 |
oct | 4560414371625 |
9 | 1130154633666 |
10 | 324340413333 |
11 | 115608787082 |
12 | 52a38b46559 |
13 | 2477b805751 |
14 | 119aba7112d |
15 | 86844e3323 |
hex | 4b8431f395 |
324340413333 has 8 divisors (see below), whose sum is σ = 432457081248. Its totient is φ = 216225343824.
The previous prime is 324340413283. The next prime is 324340413337. The reversal of 324340413333 is 333314043423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 324340413333 - 28 = 324340413077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 324340413294 and 324340413303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324340413337) 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 7 ways as a sum of consecutive naturals, for example, 204210 + ... + 830892.
It is an arithmetic number, because the mean of its divisors is an integer number (54057135156).
Almost surely, 2324340413333 is an apocalyptic number.
It is an amenable number.
324340413333 is a deficient number, since it is larger than the sum of its proper divisors (108116667915).
324340413333 is a wasteful number, since it uses less digits than its factorization.
324340413333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799203.
The product of its (nonzero) digits is 93312, while the sum is 33.
Adding to 324340413333 its reverse (333314043423), we get a palindrome (657654456756).
The spelling of 324340413333 in words is "three hundred twenty-four billion, three hundred forty million, four hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •