Base | Representation |
---|---|
bin | 1001011011100101001… |
… | …10011111111100010011 |
3 | 1010222102021021212222111 |
4 | 10231302212133330103 |
5 | 20302121040222011 |
6 | 404510410050151 |
7 | 32261100053152 |
oct | 4556246377423 |
9 | 1128367255874 |
10 | 324045242131 |
11 | 115477100636 |
12 | 52976119957 |
13 | 24732608830 |
14 | 11980797599 |
15 | 866863a121 |
hex | 4b7299ff13 |
324045242131 has 16 divisors (see below), whose sum is σ = 359850835008. Its totient is φ = 289890432000.
The previous prime is 324045242113. The next prime is 324045242173. The reversal of 324045242131 is 131242540423.
It is not a de Polignac number, because 324045242131 - 25 = 324045242099 is a prime.
It is a super-2 number, since 2×3240452421312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 324045242093 and 324045242102.
It is not an unprimeable number, because it can be changed into a prime (324045042131) 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 15 ways as a sum of consecutive naturals, for example, 1932646 + ... + 2093611.
It is an arithmetic number, because the mean of its divisors is an integer number (22490677188).
Almost surely, 2324045242131 is an apocalyptic number.
324045242131 is a deficient number, since it is larger than the sum of its proper divisors (35805592877).
324045242131 is a wasteful number, since it uses less digits than its factorization.
324045242131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4026462.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 324045242131 its reverse (131242540423), we get a palindrome (455287782554).
The spelling of 324045242131 in words is "three hundred twenty-four billion, forty-five million, two hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •