Base | Representation |
---|---|
bin | 1001011100001001101… |
… | …01011011000001000101 |
3 | 1011000012120220022110112 |
4 | 10232010311123001011 |
5 | 20303232343102010 |
6 | 405001014402405 |
7 | 32301503143310 |
oct | 4560465330105 |
9 | 1130176808415 |
10 | 324351144005 |
11 | 1156138461a9 |
12 | 52a40660405 |
13 | 24780ac1a65 |
14 | 119ad265977 |
15 | 8685412a05 |
hex | 4b84d5b045 |
324351144005 has 16 divisors (see below), whose sum is σ = 446819165184. Its totient is φ = 221414843520.
The previous prime is 324351144001. The next prime is 324351144031. The reversal of 324351144005 is 500441153423.
It is not a de Polignac number, because 324351144005 - 22 = 324351144001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (324351144001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20770616 + ... + 20786225.
It is an arithmetic number, because the mean of its divisors is an integer number (27926197824).
Almost surely, 2324351144005 is an apocalyptic number.
324351144005 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
324351144005 is a deficient number, since it is larger than the sum of its proper divisors (122468021179).
324351144005 is a wasteful number, since it uses less digits than its factorization.
324351144005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41557076.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 324351144005 its reverse (500441153423), we get a palindrome (824792297428).
The spelling of 324351144005 in words is "three hundred twenty-four billion, three hundred fifty-one million, one hundred forty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •