Base | Representation |
---|---|
bin | 1001011011111011110… |
… | …00001010101110101101 |
3 | 1010222220110021021122020 |
4 | 10231331320022232231 |
5 | 20303013003020323 |
6 | 404541244540353 |
7 | 32265555060411 |
oct | 4557570125655 |
9 | 1128813237566 |
10 | 324234423213 |
11 | 115563974138 |
12 | 52a095516b9 |
13 | 247628755bc |
14 | 1199b960d41 |
15 | 867a058ae3 |
hex | 4b7de0abad |
324234423213 has 8 divisors (see below), whose sum is σ = 435066148128. Its totient is φ = 214779490224.
The previous prime is 324234423197. The next prime is 324234423259. The reversal of 324234423213 is 312324432423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 324234423213 - 24 = 324234423197 is a prime.
It is a super-2 number, since 2×3242344232132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324234423263) 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 7 ways as a sum of consecutive naturals, for example, 344197431 + ... + 344198372.
It is an arithmetic number, because the mean of its divisors is an integer number (54383268516).
Almost surely, 2324234423213 is an apocalyptic number.
It is an amenable number.
324234423213 is a deficient number, since it is larger than the sum of its proper divisors (110831724915).
324234423213 is a wasteful number, since it uses less digits than its factorization.
324234423213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688395963.
The product of its digits is 82944, while the sum is 33.
Adding to 324234423213 its reverse (312324432423), we get a palindrome (636558855636).
The spelling of 324234423213 in words is "three hundred twenty-four billion, two hundred thirty-four million, four hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •