Base | Representation |
---|---|
bin | 1011001101110001000000… |
… | …1101010100000010101000 |
3 | 1121122211210011110222112001 |
4 | 2303130100031110002220 |
5 | 3104013114444012412 |
6 | 42120501213500344 |
7 | 2411615503235224 |
oct | 263342015240250 |
9 | 47584704428461 |
10 | 12331123032232 |
11 | 3a24666530944 |
12 | 1471a301a16b4 |
13 | 6b5a874698a4 |
14 | 308b88381784 |
15 | 165b62add957 |
hex | b37103540a8 |
12331123032232 has 32 divisors (see below), whose sum is σ = 23140486464480. Its totient is φ = 6160327320640.
The previous prime is 12331123032229. The next prime is 12331123032271. The reversal of 12331123032232 is 23223032113321.
It is a happy number.
It is a super-2 number, since 2×123311230322322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12331123032232.
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 7 ways as a sum of consecutive naturals, for example, 189266382 + ... + 189331522.
It is an arithmetic number, because the mean of its divisors is an integer number (723140202015).
Almost surely, 212331123032232 is an apocalyptic number.
It is an amenable number.
12331123032232 is a deficient number, since it is larger than the sum of its proper divisors (10809363432248).
12331123032232 is a wasteful number, since it uses less digits than its factorization.
12331123032232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84873 (or 84869 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 12331123032232 its reverse (23223032113321), we get a palindrome (35554155145553).
The spelling of 12331123032232 in words is "twelve trillion, three hundred thirty-one billion, one hundred twenty-three million, thirty-two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •