Base | Representation |
---|---|
bin | 1001011100000101000… |
… | …00111010011110110000 |
3 | 1011000002212122102202011 |
4 | 10232002200322132300 |
5 | 20303142411312144 |
6 | 404553104132304 |
7 | 32300521221133 |
oct | 4560240723660 |
9 | 1130085572664 |
10 | 324312213424 |
11 | 1155a3876071 |
12 | 52a2b607094 |
13 | 24775a10c04 |
14 | 119a801021a |
15 | 8681cc2a34 |
hex | 4b8283a7b0 |
324312213424 has 20 divisors (see below), whose sum is σ = 648624427840. Its totient is φ = 156925264320.
The previous prime is 324312213419. The next prime is 324312213439. The reversal of 324312213424 is 424312213423.
324312213424 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 326927139 + ... + 326928130.
It is an arithmetic number, because the mean of its divisors is an integer number (32431221392).
Almost surely, 2324312213424 is an apocalyptic number.
It is an amenable number.
324312213424 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
324312213424 is a wasteful number, since it uses less digits than its factorization.
324312213424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 653855308 (or 653855302 counting only the distinct ones).
The product of its digits is 27648, while the sum is 31.
Adding to 324312213424 its reverse (424312213423), we get a palindrome (748624426847).
Subtracting 324312213424 from its reverse (424312213423), we obtain a palindrome (99999999999).
The spelling of 324312213424 in words is "three hundred twenty-four billion, three hundred twelve million, two hundred thirteen thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •