Base | Representation |
---|---|
bin | 101111001011011101100… |
… | …101110010110100011000 |
3 | 102110221111010102202022221 |
4 | 233023131211302310120 |
5 | 411104331442412100 |
6 | 10521224415553424 |
7 | 453143554625245 |
oct | 57133545626430 |
9 | 12427433382287 |
10 | 3242123013400 |
11 | 103aa81a12347 |
12 | 44441852b874 |
13 | 1a69669b937b |
14 | b2cc35025cc |
15 | 59505c6101a |
hex | 2f2dd972d18 |
3242123013400 has 96 divisors (see below), whose sum is σ = 7555426243200. Its totient is φ = 1293842995200.
The previous prime is 3242123013391. The next prime is 3242123013421. The reversal of 3242123013400 is 43103212423.
It is a super-2 number, since 2×32421230134002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 208609630 + ... + 208625170.
It is an arithmetic number, because the mean of its divisors is an integer number (78702356700).
Almost surely, 23242123013400 is an apocalyptic number.
It is an amenable number.
3242123013400 is an abundant number, since it is smaller than the sum of its proper divisors (4313303229800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3242123013400 is a wasteful number, since it uses less digits than its factorization.
3242123013400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17909 (or 17900 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 3242123013400 its reverse (43103212423), we get a palindrome (3285226225823).
The spelling of 3242123013400 in words is "three trillion, two hundred forty-two billion, one hundred twenty-three million, thirteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •