Base | Representation |
---|---|
bin | 1110101001100001101000… |
… | …10110011010110000100000 |
3 | 11020001112201121220102120110 |
4 | 13110300310112122300200 |
5 | 13210234444022341000 |
6 | 152302301540211320 |
7 | 6533215315533063 |
oct | 724606426326040 |
9 | 136045647812513 |
10 | 32213133012000 |
11 | a29a570877366 |
12 | 3743155099b40 |
13 | 14c88baac5bb5 |
14 | 7d51a41cc8da |
15 | 3ace0e1a3850 |
hex | 1d4c3459ac20 |
32213133012000 has 96 divisors (see below), whose sum is σ = 105530223786624. Its totient is φ = 8590168800000.
The previous prime is 32213133011999. The next prime is 32213133012019. The reversal of 32213133012000 is 21033131223.
It is a tau number, because it is divible by the number of its divisors (96).
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 15 ways as a sum of consecutive naturals, for example, 1342201876 + ... + 1342225875.
It is an arithmetic number, because the mean of its divisors is an integer number (1099273164444).
Almost surely, 232213133012000 is an apocalyptic number.
32213133012000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
32213133012000 is an abundant number, since it is smaller than the sum of its proper divisors (73317090774624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32213133012000 is a wasteful number, since it uses less digits than its factorization.
32213133012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2684427779 (or 2684427761 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 32213133012000 its reverse (21033131223), we get a palindrome (32234166143223).
The spelling of 32213133012000 in words is "thirty-two trillion, two hundred thirteen billion, one hundred thirty-three million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •