Base | Representation |
---|---|
bin | 1011000010001100010110… |
… | …0000101101111000100000 |
3 | 1120221211120221101010102210 |
4 | 2300203011200231320200 |
5 | 3042233423120111000 |
6 | 41445300254442120 |
7 | 2361346510536423 |
oct | 260430540557040 |
9 | 46854527333383 |
10 | 12132301332000 |
11 | 39583098a4803 |
12 | 143b3a3203340 |
13 | 6a00c02b4915 |
14 | 2dd2c69819ba |
15 | 1608c7d1a350 |
hex | b08c582de20 |
12132301332000 has 192 divisors, whose sum is σ = 40819621175424. Its totient is φ = 3147840230400.
The previous prime is 12132301331959. The next prime is 12132301332059. The reversal of 12132301332000 is 23310323121.
It is a super-2 number, since 2×121323013320002 (a number of 27 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 13218502 + ... + 14106501.
It is an arithmetic number, because the mean of its divisors is an integer number (212602193622).
Almost surely, 212132301332000 is an apocalyptic number.
12132301332000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12132301332000 is an abundant number, since it is smaller than the sum of its proper divisors (28687319843424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12132301332000 is a wasteful number, since it uses less digits than its factorization.
12132301332000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27325068 (or 27325050 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12132301332000 its reverse (23310323121), we get a palindrome (12155611655121).
The spelling of 12132301332000 in words is "twelve trillion, one hundred thirty-two billion, three hundred one million, three hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •