Base | Representation |
---|---|
bin | 1011001101110000100110… |
… | …0010011010011110111100 |
3 | 1121122211111100220102002120 |
4 | 2303130021202122132330 |
5 | 3104012402321420012 |
6 | 42120442135122540 |
7 | 2411612644102512 |
oct | 263341142323674 |
9 | 47584440812076 |
10 | 12331011123132 |
11 | 3a24609345989 |
12 | 14719ba813450 |
13 | 6b5a6a2165a0 |
14 | 308b775704b2 |
15 | 165b57d8558c |
hex | b370989a7bc |
12331011123132 has 96 divisors (see below), whose sum is σ = 33741144729600. Its totient is φ = 3470517695232.
The previous prime is 12331011123127. The next prime is 12331011123149. The reversal of 12331011123132 is 23132111013321.
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 31 ways as a sum of consecutive naturals, for example, 71642668 + ... + 71814579.
It is an arithmetic number, because the mean of its divisors is an integer number (351470257600).
Almost surely, 212331011123132 is an apocalyptic number.
12331011123132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12331011123132 is an abundant number, since it is smaller than the sum of its proper divisors (21410133606468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12331011123132 is a wasteful number, since it uses less digits than its factorization.
12331011123132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143457315 (or 143457313 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 12331011123132 its reverse (23132111013321), we get a palindrome (35463122136453).
The spelling of 12331011123132 in words is "twelve trillion, three hundred thirty-one billion, eleven million, one hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •