Base | Representation |
---|---|
bin | 1001011100010000001… |
… | …11110111010010011001 |
3 | 1011000100102201001001001 |
4 | 10232020013313102121 |
5 | 20303341003410131 |
6 | 405010305025001 |
7 | 32303043065242 |
oct | 4561007672231 |
9 | 1130312631031 |
10 | 324406310041 |
11 | 1156419a5270 |
12 | 52a57025161 |
13 | 2478c368698 |
14 | 119b6705cc9 |
15 | 868a1ad261 |
hex | 4b881f7499 |
324406310041 has 8 divisors (see below), whose sum is σ = 353987502624. Its totient is φ = 294840069120.
The previous prime is 324406310021. The next prime is 324406310047. The reversal of 324406310041 is 140013604423.
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 324406310041 - 223 = 324397921433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 324406309991 and 324406310009.
It is not an unprimeable number, because it can be changed into a prime (324406310047) 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, 3692520 + ... + 3779353.
It is an arithmetic number, because the mean of its divisors is an integer number (44248437828).
Almost surely, 2324406310041 is an apocalyptic number.
It is an amenable number.
324406310041 is a deficient number, since it is larger than the sum of its proper divisors (29581192583).
324406310041 is a wasteful number, since it uses less digits than its factorization.
324406310041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7475831.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 324406310041 its reverse (140013604423), we get a palindrome (464419914464).
The spelling of 324406310041 in words is "three hundred twenty-four billion, four hundred six million, three hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •