Base | Representation |
---|---|
bin | 1001011100001000010… |
… | …11011101100100110011 |
3 | 1011000011211012110220001 |
4 | 10232010023131210303 |
5 | 20303222034110220 |
6 | 404555542530431 |
7 | 32301310511506 |
oct | 4560413354463 |
9 | 1130154173801 |
10 | 324340144435 |
11 | 11560861304a |
12 | 52a38a36a17 |
13 | 2477b740238 |
14 | 119aba0113d |
15 | 868448d80a |
hex | 4b842dd933 |
324340144435 has 8 divisors (see below), whose sum is σ = 392272805376. Its totient is φ = 257429027520.
The previous prime is 324340144409. The next prime is 324340144481. The reversal of 324340144435 is 534441043423.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 324340144435 - 237 = 186901190963 is a prime.
It is a super-2 number, since 2×3243401444352 (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 = 324340144394 and 324340144403.
It is an unprimeable number.
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, 255385306 + ... + 255386575.
It is an arithmetic number, because the mean of its divisors is an integer number (49034100672).
Almost surely, 2324340144435 is an apocalyptic number.
324340144435 is a deficient number, since it is larger than the sum of its proper divisors (67932660941).
324340144435 is a wasteful number, since it uses less digits than its factorization.
324340144435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510772013.
The product of its (nonzero) digits is 276480, while the sum is 37.
Adding to 324340144435 its reverse (534441043423), we get a palindrome (858781187858).
The spelling of 324340144435 in words is "three hundred twenty-four billion, three hundred forty million, one hundred forty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •