Base | Representation |
---|---|
bin | 1101000001110010010000… |
… | …0101011001000010010000 |
3 | 1212201101120120201022111212 |
4 | 3100130210011121002100 |
5 | 3334142202224401300 |
6 | 50244300302355252 |
7 | 3005620015211525 |
oct | 320344405310220 |
9 | 55641516638455 |
10 | 14324321325200 |
11 | 4622a01a54547 |
12 | 173419628bb28 |
13 | 7cba15805333 |
14 | 37742d77114c |
15 | 19c91d8c0935 |
hex | d0724159090 |
14324321325200 has 60 divisors (see below), whose sum is σ = 35344295046900. Its totient is φ = 5574870996480.
The previous prime is 14324321325187. The next prime is 14324321325289. The reversal of 14324321325200 is 252312342341.
It can be written as a sum of positive squares in 6 ways, for example, as 1424069902336 + 12900251422864 = 1193344^2 + 3591692^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 483914975 + ... + 483944574.
It is an arithmetic number, because the mean of its divisors is an integer number (589071584115).
Almost surely, 214324321325200 is an apocalyptic number.
14324321325200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14324321325200 is an abundant number, since it is smaller than the sum of its proper divisors (21019973721700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14324321325200 is a wasteful number, since it uses less digits than its factorization.
14324321325200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967859604 (or 967859593 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 14324321325200 its reverse (252312342341), we get a palindrome (14576633667541).
The spelling of 14324321325200 in words is "fourteen trillion, three hundred twenty-four billion, three hundred twenty-one million, three hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •